Difference between revisions of "SpeedHeise"
Line 1:  Line 1:  
{{Substep Infobox  {{Substep Infobox  
name=SpeedHeise  name=SpeedHeise  
−  image=  +  image=speedheise.png 
proposers=[[Matt DiPalma]]  proposers=[[Matt DiPalma]]  
variants=[[LPELL]], intuitive  variants=[[LPELL]], intuitive 
Revision as of 18:48, 2 November 2016


SpeedHeise is an algorithm set developed by Matt DiPalma for use with methods that preorient the edges before the last slot (ZZ, Petrus, Heise). During the last F2L insertion, SpeedHeise solves all 4 LLedges and 1 LLcorner. This leaves the cube in a state that can be solved with a single, intuitive commutator/conjugate, known as L3C cube state which can be finished with L3C step. The algorithm set is essentially an expansion of LPELL with a large boost in efficiency.
After finishing F2L1+EO, the final pair is created in the Ulayer and AUFed to the FrontRight, as Winter Variation. Then, the permutation of LL edges is recognized, exactly as LPELL. Then, the sticker at DFR is identified and the destination of this sticker (12 possibilities) is observed. These two pieces of information are used to identify the SpeedHeise case, which will insert the pair, solve the LL edges, and place the corner at DFR. Finally, the appropriate algorithm is executed, leaving the cube only a short, ergonomic sequence from solved.
The full version (72 algs) accommodates any orientation of the DFR corner. A simplified version only considers the 24 cases in which the DFR corner is oriented downwards. Both versions are included in the external links, below.
The movecount may be significantly reduced by intelligent algorithm selection, as discussed on the Complete SpeedHeise page, linked below.