Play a virtual Starminx II in your browser. Starminx II is a jumbling puzzle.
Info
Pieces
Type
Count
Stickers
Positions
Orientation (physical)
Orientation (visual)
0
1
0
1
60
1
1
30
0
30
2
1
2
60
0
60
1
1
3
60
0
60
1
1
3
20
0
20
3
1
4
60
0
60
1
1
4
60
0
60
1
1
4
60
0
60
1
1
5
30
2
30
2
2
5
60
1
60
1
1
5
12
1
12
5
1
One row per orbit. Orientation counts are per position; multiple values mean positions differ. Jumbling: counts cover placements discovered so far, not all possible placements.
Stickers
132
Axes
1530 cut planes across them
Turns
Jumbling
Solver
Not availableSolving is not available while jumbling moves are enabled.
Distinct-piece states
Not computedIt is worked out from the same model of the puzzle the solver uses.
Indistinguishable arrangements
8,916,100,448,256,000,000,000,0005! × 5! × 5! × 5! × 5! × 5! × 5! × 5! × 5! × 5! × 5! × 5! = 8,916,100,448,256,000,000,000,00012 groups of visually interchangeable pieces within their movement orbits, using the original stickers.Counts all permutations within these groups, without checking which combinations are reachable. Internal pieces are excluded because the state count tracks stickers only.
Visually distinct states
Not computedVisually distinct states = distinct-piece states ÷ reachable indistinguishable arrangements.Reachable indistinguishable arrangements = 8,916,100,448,256,000,000,000,000 × reachable fraction.The reachable fraction accounts for restrictions such as permutation parity. Computing the correct fraction and the final visual state count is not yet implemented.