# Virtual Cubes Activate JavaScript to see the Virtual Cubes!

### Rubik's Cube

The Rubik's Cube is a 3-D mechanical puzzle invented in 1974 by Hungarian sculptor and professor of architecture Ernö Rubik. Each of the six faces of a Rubik's Cube is covered by nine stickers, among six solid colors (traditionally blue, green, red, orange, yellow, and white). A pivot mechanism enables each face to turn independently, thus mixing up the colors. For the puzzle to be solved, each face must be a solid color.

A Rubik's Cube consists of 26 unique miniature cubes, also called 'cubies': 8 corners, 12 edges, and 6 centers. The six centers are affixed to the core mechanism. The 3x3x3 cube has a total of 54 stickers.

#### The number of possible positions

The number of possible positions of the cube is 8! × 37 × 12! / 2 × 211 = 43'252'003'274'489'856'000 ≈ 43.252 × 1018 which is about 43.3 quintillion on the short scale or 43.3 trillion on the long scale.

The Rubik's Cube has eight corners and twelve edges. There are 8! (40'320) ways to arrange the corners. Seven can be oriented independently, and the orientation of the eighth depends on the preceding seven, giving 37 (2'187) possibilities. There are 12! / 2 (239'500'800) ways to arrange the edges, since an odd permutation of the corners implies an odd permutation of the edges as well. Eleven edges can be flipped independently, with the flip of the twelfth depending on the preceding ones, giving 211 (2'048) possibilities.

A Rubik's Cube usually has no orientation markings on the centers and therefore solving it does not require any attention orienting those parts correctly. Marking the Rubik's Cube's centers increases its difficulty because this expands the set of distinguishable possible positions. There are 46 / 2 (2'048) ways to orient the centers, since an even permutation of the corners implies an even number of quarter turns of the centres as well. An alternative explanation is: There are 45 × 2 = 211 (2'048) ways to orient the centers, since five of the six centers can be twisted independently of one another into each of four different orientations, and for the sixth center there still exist two possibilities. Thus orientations of centers increases the total number of possible positions from 43'252'003'274'489'856'000 ≈ 43.252 × 1018 to 88'580'102'706'155'225'088'000 ≈ 88.58 × 1021.

#### The diameter of the Rubik's Cube

In July 2010, Tomas Rokicki, Herbert Kociemba, Morley Davidson, and John Dethridge proved the so-called God's Number to be 20 in face-turn metric (ftm). This means that every position of Rubik's Cube can be solved in twenty moves or less. Distance-20 positions or antipodes (positions that are maximally far from solved) are both rare and plentiful; they are rarer than one in a billion positions, yet there are probably more than one hundred million such positions. The exact number of antipodes is not yet known.

In August 2014, Tomas Rokicki and Morley Davidson proved that God's Number in the quarter-turn metric (qtm) is 26. In qtm, only a single position (Superflip composed with four spots) plus its two rotations is known that requires the maximum of 26 moves.

The slice turn metric allows any quarter- or half-turn of a middle 'slice' as one move. (There seems to be less interest in counting only slice quarter turns.) Since these allowed moves include the HTM moves, the upper bound here is 20. The conjecture is that God's number in this STM is 18. See also What is God's Number if Slice Moves are Allowed? for further informations.

In the Super Group, where the rotations of the centers are regarded as well, the number of possible positions is 2'048 times higher then in the regular Cube Group (46/2 = 2'048). Walter Randelshofer discovered in July 19, 2014 that the 'Pure Superflip' (Superflip with untouched centers) can be solved optimally in 24 moves in face-turn metric (ftm). In July 22, 2014 he also found that the '180° Superflip' (Superflip with all centers rotated around 180°) requires 20 moves in slice-turn metric (stm). Bruce Norskog assumed that there must exist positions that require at least 28 moves in quarter-turn metric (qtm). This was confirmed in September 9, 2014 by Herbert Kociemba for a specific 'Superflip composed with four spots' position, where all centers except the upper one are rotated around 180°. See also the article Lower bounds for the 3x3x3 Super Group for further informations.

More generally, it has been shown that an N × N × N Rubik's Cube can be solved optimally in Θ(n2 / log(n)) moves. See also Algorithms for Solving Rubik's Cubes by Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw and Andrew Winslow.

#### Possible orders

In July 27, 1981 Jesper C. Gerved and Torben Maack Bisgaard proved that there are 73 different possible orders in the group of the Rubik's Cube. The orders are: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 18, 20, 21, 22, 24, 28, 30, 33, 35, 36, 40, 42, 44, 45, 48, 55, 56, 60, 63, 66, 70, 72, 77, 80, 84, 90, 99, 105, 110, 112, 120, 126, 132, 140, 144, 154, 165, 168, 180, 198, 210, 231, 240, 252, 280, 315, 330, 336, 360, 420, 462, 495, 504, 630, 720, 840, 990, 1'260.

The most common order is 60 with a total of 4'601'524'692'892'925'952 elements (10.64% of all cube positions), followed by the orders 24 and 36. The maximal order is 1'260 and counts 51'490'480'088'678'400 elements (0.119% of all cube positions).

See the document Number of elements of each order in the group of Rubik's Cube for further informations.

#### The maximum permutation order

The maximum permutation order of a regular Rubik's Cube is 1'260. It can be achieved by twisted corner 3-cycles and 5-cycles: 3 × (3 × 5) = (9 × 5); twisted edge 2-cycles and 7-cycles: 2 × (2 × 7) = (4 × 7). This results in a Least Common Multiple (LCM) of (9 × 5) × (4 × 7) = 1'260. The order can be reached by the following algorithm found by David Singmaster: B2 R' F D' F (5 ltm). Note, that the maxium permutation order for a Super Cube version is higher.