Difference between revisions of "Speed-Heise"

From Speedsolving.com Wiki
Line 4: Line 4:
 
|proposers=[[Matt DiPalma]]
 
|proposers=[[Matt DiPalma]]
 
|variants=[[LPELL]], intuitive
 
|variants=[[LPELL]], intuitive
|anames=Step 3 of [[Heise]]
+
|anames=Step 3 of [[Heise]], Heise 3/4
 
|year=2014
 
|year=2014
 
|subgroup=
 
|subgroup=
Line 11: Line 11:
 
|purpose=<sup></sup>
 
|purpose=<sup></sup>
 
* [[Speedsolving]], [[FMC]]
 
* [[Speedsolving]], [[FMC]]
 +
|previous=[[F2L-1 + EO cube state]]
 +
|next=[[L3C cube state]]
 
}}
 
}}
  
Speed-Heise is an algorithm set developed by [[Matt DiPalma]] for use with methods that pre-orient the edges before the [[last slot]] ([[ZZ]], [[Petrus]], [[Heise]]). During the last F2L insertion, Speed-Heise solves all 4 LL-edges and 1 LL-corner. This leaves the cube in a state that can be solved with a single, intuitive [[commutator]]/conjugate, known as [[L3C]]. The algorithm set is essentially an expansion of [[LPELL]] with a large boost in efficiency.
+
'''Speed-Heise''' is an algorithm set developed by [[Matt DiPalma]] for use with methods that pre-orient the edges before the [[last slot]] ([[ZZ]], [[Petrus]], [[Heise]]). During the last F2L insertion, Speed-Heise solves all 4 LL-edges and 1 LL-corner. 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 EOF2L-1, the final pair is created in the U-layer and AUFed to the Front-Right, 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 Speed-Heise 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.
+
After finishing [[F2L-1 + EO cube state|F2L-1+EO]], the final pair is created in the U-layer and AUFed to the Front-Right, 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 Speed-Heise 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 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.

Revision as of 20:22, 22 August 2015

Speed-Heise
[[Image:]]
Information
Proposer(s): Matt DiPalma
Proposed: 2014
Alt Names: Step 3 of Heise, Heise 3/4
Variants: LPELL, intuitive
Subgroup:
No. Algs: 24 (simplified) / 72 (full)
Avg Moves: 9.305 (Speed-Optimal HTM)
Purpose(s):


Speed-Heise is an algorithm set developed by Matt DiPalma for use with methods that pre-orient the edges before the last slot (ZZ, Petrus, Heise). During the last F2L insertion, Speed-Heise solves all 4 LL-edges and 1 LL-corner. 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 F2L-1+EO, the final pair is created in the U-layer and AUFed to the Front-Right, 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 Speed-Heise 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 Speed-Heise page, linked below.


External links