Thistlethwaite's algorithm

Thistlethwaite method Information about the method Proposer(s): Morwen Thistlethwaite Proposed: 1981 Alt Names: none Variants: Human Thistlethwaite No. Steps: 4 No. Algs: unknown Avg Moves: 31.3 Purpose(s): Computer Algorithm Fewest Moves

A computer cube solving algorithm, based on reducing the cube to subgroups.

Steps

1. Reduction to G₁ = <U,D,L,R,F2,B2>
   • Edge Orientation
2. Reduction to G₂ = <U,D,L2,R2,F2,B2> (also known as Domino Reduction)
   • placement of U/D edges in U/D faces
   • Corner Orientation, and placement
3. Reduction to G₃ = <U2,D2,L2,R2,F2,B2> (also known as Half Turn Reduction)
   • Corners
   • Edges
4. Final Solve
   Permutation of all pieces using only 180 degree faces turns

See also

• Human Thistlethwaite
• Kociemba
• God's Algorithm
• Puzzle theory
• Rubik's Cube Group
• Edge Orientation
• Domino Reduction
• Half Turn Reduction

External links

• Jaap's Thistlethwaite page
• Wikipedia: Morwen Thistlethwaite