Beyer-Hardwick Method

From Speedsolving.com Wiki

Beyer-Hardwick Method. A 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.

External Links

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