Beyer-Hardwick Method

From Speedsolving.com Wiki
Revision as of 10:44, 19 May 2017 by LSLL (talk | contribs) (Edit)

Beyer-Hardwick Method. An advanced blindsolving method based on the use of 3-cycle algorithms. The fundamental idea behind the BH method is to use pre-memorized, move optimal, commutator 3-cycles for all possible 3-cycles starting from a fixed buffer location. For pieces where orientation is defined, the position and orientation of pieces are solved simultaneously. The use of commutators allows the BH method to be used for solving any sized cube blindfolded.

BH Corners

These are the different types of commutators you will "see" while learning BH.

Pure Commutators (8 moves) - are the purest and smallest form of commutators and all other commutators are just setups into them hence called Pure Commutators (except Cyclic Shifts and Per Specials). They follow this formula: ABA'B' or [A, B] for short.

A is always a 3 move insert B is the interchange move and always 1 move and opposite from the middle move of A. Ex [R U R', D] U is the middle move of the A move that means the

External links

This page is a DNF (incomplete).
Please help by expanding it.
There may be suggestions on its talk page.