Human Thistlethwaite Algorithm
From Speedsolving.com Wiki
(Redirected from Human Thistlethwaite)
| ||||||||||||||||||||||
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:
- Reduction to G₁ = <U,D,L,R,F2,B2>
- Reduction to G₂ = Domino Reduction = <U,D,L2,R2,F2,B2>
- placement of U/D edges in U/D faces
- Corner Orientation, and separation
- Reduction to G₃ = Half Turn Reduction = <U2,D2,L2,R2,F2,B2>
- Corner Permutation
- Edge Phasing or EO on all axis
- Final Solve
Permutation of all pieces using only 180 degree faces turns
Advanced Techniques
- Æ: Æ, or Algorithimic EO could be done to improve TPS and ergonomics. Althought the full alg set would be to big to use on its own, there are similar ways to do it.
Small Æ: Orient the DL, FL and BL edges. Then use algorithimic pre DFDB EO from LEOR * EO algsheet Big Æ: Orient the DL, FL, BL, DF, and DB edges. Then use algorithimic EO from Petrus https://www.kungfoomanchu.com/guides/petrus.pdf
- RaR: RaR or HTRr, is a theory that it is possible to solve the F2B edges while doing G3 stage to force a L6EP. https://docs.google.com/spreadsheets/d/1KYdD4pLiX-PTym6xGpOqVCnaGNhOF5xw4dbIkEMeIMY/edit?gid=1941046113#gid=1941046113
