(Canceled) Petition to make Kilominx/2x2 Megaminx an official WCA event.

I think the major obstacle to this event becoming official is the scrambling issue. Some questions to answer:

  • Is random state possible for Kilominx?
    • If a solver is found, how many moves is the solution (and thus, how many moves is the scramble)?
    • Will the scrambles need to be done using 12-sided notation? Or is there a reasonable way to make scrambling more efficient and accurate? (Maybe having scrambling phases with 2-3 rotations in the middle, only turning on parts of the puzzle in each phase?)
  • If random state is not feasible for computers or for scramblers, is Pochmann notation enough for Kilominx? By that, I mean:
    • Are key features of scrambles that should be uniformly distributed still uniformly distributed with this random-move scrambling? (example of center permutation on Mega scrambles done by Stefan)
    • Are scramblers reasonably accurate (>80%) with this notation?
I think once enough support for the puzzle has been held for a long time and these issues have been figured out and enough WCA parties are in support as well, the rest of the issues are trivial for making this an event. But I really think an appropriate scrambler needs to be found for this puzzle, and that's not a small amount of work.
 
I think the major obstacle to this event becoming official is the scrambling issue. Some questions to answer:

  • Is random state possible for Kilominx?
    • If a solver is found, how many moves is the solution (and thus, how many moves is the scramble)?
    • Will the scrambles need to be done using 12-sided notation? Or is there a reasonable way to make scrambling more efficient and accurate? (Maybe having scrambling phases with 2-3 rotations in the middle, only turning on parts of the puzzle in each phase?)
  • If random state is not feasible for computers or for scramblers, is Pochmann notation enough for Kilominx? By that, I mean:
    • Are key features of scrambles that should be uniformly distributed still uniformly distributed with this random-move scrambling? (example of center permutation on Mega scrambles done by Stefan)
    • Are scramblers reasonably accurate (>80%) with this notation?
I think once enough support for the puzzle has been held for a long time and these issues have been figured out and enough WCA parties are in support as well, the rest of the issues are trivial for making this an event. But I really think an appropriate scrambler needs to be found for this puzzle, and that's not a small amount of work.
We're working on that. We will hopefully release something in 2 years when we plan to remake the Petition (If Kilohype is alive.)
Right now I have to learn Javascript so I can assist my friend with the scramble program.
 
I think the major obstacle to this event becoming official is the scrambling issue. Some questions to answer:

  • Is random state possible for Kilominx?
    • If a solver is found, how many moves is the solution (and thus, how many moves is the scramble)?
    • Will the scrambles need to be done using 12-sided notation? Or is there a reasonable way to make scrambling more efficient and accurate? (Maybe having scrambling phases with 2-3 rotations in the middle, only turning on parts of the puzzle in each phase?)
  • If random state is not feasible for computers or for scramblers, is Pochmann notation enough for Kilominx? By that, I mean:
    • Are key features of scrambles that should be uniformly distributed still uniformly distributed with this random-move scrambling? (example of center permutation on Mega scrambles done by Stefan)
    • Are scramblers reasonably accurate (>80%) with this notation?
I think once enough support for the puzzle has been held for a long time and these issues have been figured out and enough WCA parties are in support as well, the rest of the issues are trivial for making this an event. But I really think an appropriate scrambler needs to be found for this puzzle, and that's not a small amount of work.
I'll try and make a scramblers, just learned Java and C++ during the past 2 weeks so this will be an interesting way to test my skills too.
 
I'll try and make a scramblers, just learned Java and C++ during the past 2 weeks so this will be an interesting way to test my skills too.

We already have a pretty awesome random-state scrambler from the other thread:

I just finished writing a rudimentary kilominx solver. The "x2" rotations are denoted as "flip" instead of "x2" because x rotations already mean something else, but that can be easily changed. (It's possibly buggy and definitely slow; your mileage may vary.)

Code:
>>> print_move_sequence(solve(random_state()))
"F2 flip R2 BR2' U F2' U2 BR' R2 BR2 flip F2' BL2' BR' U' BR' BL2 L2 U F U2' R U' R2' F2' U R2 F2' U' R2 U'"
>>> print_move_sequence(solve(random_state()))
"F2' R2 BL U2 L' BL' BR flip U' F' BL2 U2' BR2' R2' F2' L2 U R F R' U2 F U' R' F2' R2' U2'"
>>> print_move_sequence(solve(random_state()))
"R flip U R' BR2 BL2 BR2' BL2 BR' flip U' R2 BL2 U2 L2 BL2 BR BL' F U2 R' U' F2' R2 U2 R' F R2 F2 R2'"
>>> print_move_sequence(solve(random_state()))
"U R F2' L' U2' R2 L' flip U R2' BR' U2 BL' BR U F2 L2' U2' R2 U F2' R2 U' F2' R2 U2' F2' U' R2"

Although feel free to make your own too; it's a good way to work on programming skills. :)
 
Back
Top