5x5x5Loading…

5x5x5 simulator and solver

Play a virtual 5x5x5 in your browser, or enter the colors of your own 5x5x5 and get a solution. Also known as Professor's Cube.

Info

Pieces
TypeCountStickersPositionsOrientation (physical)Orientation (visual)
261641
32412411
41221222
42412411
52422411
683833
One row per orbit. Orientation counts are per position; multiple values mean positions differ.
Stickers
150
Axes
312 cut planes across them
Solver
Available
Distinct-piece states
≈ 2.58 × 10⁹⁰61,983,270,549,287,025,099,907,672,756,192,406,062,034,134,561,301,691,171,474,691,309,654,209,724,416,000,000,000,000,000 arrangements of the stickers the moves reach (Schreier–Sims)÷ 24 turns of the whole puzzle= 2,582,636,272,886,959,379,162,819,698,174,683,585,918,088,940,054,237,132,144,778,804,568,925,405,184,000,000,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
36,520,347,436,056,5764! × 4! × 4! × 4! × 4! × 4! × 4! × 4! × 4! × 4! × 4! × 4! = 36,520,347,436,056,57612 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 = 36,520,347,436,056,576 × 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 1,440 reaches the original sticker identities8!·3⁸ · 24!·1²⁴ · 12!·2¹² · 24!·1²⁴ · 24!·1²⁴ · 6!·1⁶ = 89,255,909,590,973,316,143,867,048,768,917,064,729,329,153,768,274,435,286,923,555,485,902,062,003,159,040,000,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÷ 61,983,270,549,287,025,099,907,672,756,192,406,062,034,134,561,301,691,171,474,691,309,654,209,724,416,000,000,000,000,000 arrangements the moves reach = 1,440This uses distinct piece identities; the chance of reaching a visually solved state may be higher.

Moves

Face turns

x
y
z

Well known algorithms and patterns

Patterns

Checkerboard

(2L2 4L2) (2D2 4D2) (2B2 4B2)

Generalized alternating-layer checkerboard, verified against every sticker on each face. Even cubes have four checkered faces and two solid faces.

Outer-layer Superflip

U R2 F B R B2 R U2 L B2 R U' D' R2 F R' L B2 U2 F2

Outer-layer adaptation of the published 3×3 Superflip: all edge rows flip in place, corners stay solved, center colors stay on their faces.

Outer-layer cube in a cube

F L F U' R U F2 L2 U' L' B D' B' L2 U

Outer-layer adaptation of the published 3×3 cube-in-a-cube pattern.

Six spots

U D' R L' F B' U D'

Outer-layer adaptation of the published 3×3 Six spots. The larger interior squares form the spots.