Beyer-Hardwick Method

From Speedsolving.com Wiki
Revision as of 02:26, 5 November 2009 by Cmhardw (talk | contribs)

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.

External Links

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