Rubik's Cube — Definition, Formula & Example
The Rubik's Cube is a 3×3×3 twisting puzzle. In group theory it defines a group: every sequence of face turns is an element, and doing one sequence after another is the group operation.
Label the 48 movable facelets (the 54 stickers minus the 6 fixed centers). The Rubik's Cube group is the subgroup generated by the six permutations induced by clockwise quarter turns of the faces. Its structure is , where the first factor records corner twists and edge flips, and the second records how the 8 corners and 12 edges are permuted.
Key Formula
Where:
- = Ways to place the 8 corner pieces
- = Orientations of the corners (3 twists each)
- = Ways to place the 12 edge pieces
- = Orientations of the edges (2 flips each)
- = Factor removed by the three invariants that legal turns preserve
Worked Example
Problem: Suppose you take a Rubik's Cube apart and snap the pieces back in at random. How many of these assemblies can be solved by turning the faces?
Step 1: Count every possible reassembly. Each corner can go in any corner slot with any of 3 twists. Each edge can go in any edge slot with either of 2 flips.
Step 2: Face turns preserve three invariants. The total corner twist is . The total edge flip is . The corner permutation and the edge permutation always have the same parity. Each invariant cuts the count by its modulus, and together they cut it by a factor of 12.
Step 3: Divide by 12. Every arrangement that satisfies all three invariants can actually be reached, so the quotient is the order of .
Answer: Only 1 in 12 random reassemblies can be solved. The group has order 43,252,003,274,489,856,000, which is about 43 quintillion.
Why It Matters
Abstract algebra courses use the cube to show cosets, parity, homomorphisms and commutators on one concrete object. Speedcubing algorithms are built from commutators , which disturb only a few pieces. Computer searches over coset decompositions of proved in 2010 that every position can be solved in at most 20 moves when a half turn counts as one move.
Common Mistakes
Mistake: Assuming any arrangement of the pieces can be solved, for example a cube with just one edge flipped.
Correction: Turns never change the total edge flip mod 2, so a single flipped edge lies outside . Before you search for an algorithm, check the three invariants: corner twist, edge flip and permutation parity.
