Beyer-Hardwick Corner Algorithms
Hello and welcome to Daniel's and Chris' page about our jointly created blind solving method. The method was created by Daniel Beyer and Chris Hardwick to be used as an advanced method for solving any sized cube blindfolded. This page is under construction, so please bear with us as we add more material to this website.

This particular page is about solving corners using the Beyer-Hardwick method. The goal is to use an optimal length algorithm for all 3-cycles starting from a fixed buffer piece. You perform sticker cycles, and will thus solve the position and orientation of any given corner at the same time. The goal is to have a prepared algorithm for every possible cycle, reducing the thinking time during solving. Other pages will be devoted to how to figure out which type of algorithm to use given a certain cycle. This is based on the case name for each algorithm. If you are interested to learn the method, please continue to check back for further pages explaining how to use the case names of each algorithm below.

Here are the number of each length algorithm necessary to solve all possible corner 3-cycles starting from a fixed buffer.

 Optimal Solution Length (in HTM) # of cases 8 turns: 198 cases 9 turns: 126 cases 10 turns: 30 cases 11 turns: 18 cases 12 turns: 6 cases Total Case Count: 378 cases

The following are all algorithms necessary to use the Beyer-Hardwick method for corners. Please bear in mind that there are often multiple algorithms you could use for a certain case. The case name is more important for each algorithm than the given algorithm. In later pages to follow you will see how to use the case name for a certain cycle to construct the correct algorithm when solving. We include one algorithm for each case merely for completeness.