Human Thistlethwaite Algorithm

From Wiki
Revision as of 11:54, 18 June 2017 by Stannic (talk | contribs) (fix wikilinks; remove repeated wikilinks; http(s)-preserving internal links; will need a page Square group (Singmaster 1981, p.18))
Human Thistlethwaite method
Information about the method
Proposer(s): Morwen Thistlethwaite
Ryan Heise
Proposed: 2002
Alt Names: HTA
Variants: Thistlethwaite Algorithm
No. Steps: 4
No. Algs: Advanced method: Hundreds, Basic method: 3
Avg Moves: Advanced method: 45.7, Basic method: ~100

The Human Thistlethwaite Algorithm (abbreviated to HTA) is a human-usable version, proposed by Ryan Heise, of the Thistlethwaite's algorithm. The solution is broken down into exactly the same basic steps of the computer Thistlethwaite algorithm, but each step in the human version is broken down into further sub-steps to make it managable for a human solver. The system proceeds as follows:

  1. Reduction to <U,D,L,R,F2,B2>
  2. Reduction to <U,D,L2,R2,F2,B2>
  3. Reduction to <U2,D2,L2,R2,F2,B2>
    • Corners
    • Edges
  4. Final Solve
    Permutation of all pieces using only 180 degree faces turns

See also

External links