Shallow Face-Turning Rhombic Dodecahedron without jumblingLoading…
Shallow Face-Turning Rhombic Dodecahedron without jumbling simulator and solver
Play a virtual Shallow Face-Turning Rhombic Dodecahedron without jumbling in your browser, or enter the colors of your own Shallow Face-Turning Rhombic Dodecahedron without jumbling and get a solution.
Info
Pieces
Type
Count
Stickers
Positions
Orientation (physical)
Orientation (visual)
1
12
1
12
2
1
2
24
2
24
1
1
3
8
3
8
3
3
3
24
1
24
1
1
4
6
4
6
4
4
One row per orbit. Orientation counts are per position; multiple values mean positions differ.
Stickers
132
Axes
612 cut planes across them
Solver
Available
Distinct-piece states
≈ 1.36 × 10⁴⁸32,520,609,022,656,453,720,333,092,448,935,828,520,960,000,000,000 arrangements of the stickers the moves reach (Schreier–Sims)÷ 24 turns of the whole puzzle= 1,355,025,375,944,018,905,013,878,852,038,992,855,040,000,000,000Tracks individual sticker identities, even on identical-looking pieces; whole-puzzle rotations are identified. Invisible rotations of a piece and internal pieces are not counted.
Indistinguishable arrangements
4,0962! × 2! × 2! × 2! × 2! × 2! × 2! × 2! × 2! × 2! × 2! × 2! = 4,09612 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 = 4,096 × 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.
Put together at random
1 in 4,423,567,308,653,651,558,400 reaches the original sticker identities8!·3⁸ · 24!·1²⁴ · 24!·1²⁴ · 6!·4⁶ · 12!·1¹² = 143,857,102,930,130,066,760,256,934,509,767,394,081,550,825,510,000,671,064,064,000,000,000,000 ways to put the pieces in: per type of piece, its pieces in any order and each in any orientation that looks different÷ 32,520,609,022,656,453,720,333,092,448,935,828,520,960,000,000,000 arrangements the moves reach = 4,423,567,308,653,651,558,400This uses distinct piece identities; the chance of reaching a visually solved state may be higher.