Difference between revisions of "LLEF"
(→Adjacent LB: Fat anti also) 

Line 4:  Line 4:  
It can however be useful for [[FMC]]. LLEF has a low average optimal solution length of 7.87, while for the last four corners it is 11.73 (a half move more than optimal [[PLL]]). Both of these can however be lowered. One can quite often choose a inversion/mirror version of an alg to solve the same LLEF situation thus increasing one's chances of cancelling move and/or getting a better corner case. [[Partial Edge ControlPartial edge control]] can also be used to avoid the cases with four flipped edges. The corners can in turn be solved more efficiently with inserted corner 3cycles rather than at the very end of the solution.  It can however be useful for [[FMC]]. LLEF has a low average optimal solution length of 7.87, while for the last four corners it is 11.73 (a half move more than optimal [[PLL]]). Both of these can however be lowered. One can quite often choose a inversion/mirror version of an alg to solve the same LLEF situation thus increasing one's chances of cancelling move and/or getting a better corner case. [[Partial Edge ControlPartial edge control]] can also be used to avoid the cases with four flipped edges. The corners can in turn be solved more efficiently with inserted corner 3cycles rather than at the very end of the solution.  
−  Solving ELL first is 15 cases.  +  Solving ELL first is 15 cases from a group of totally 48, i.e. a skip of this step occures 1:48 times, skip to [[EP]] occures 1:8 times and skip to pure [[EO]] occures 1:6 times. 
===See also:===  ===See also:=== 
Revision as of 08:04, 9 August 2010
 Last Layer Edges First
The ELL (Edges of the Last Layer) that ignores corners is easier to solve, it uses both lesser moves and has lesser cases than what is the 'normal ELL'. This variation is useful for a 2look method that solves corners last. But this corner method (sub group of ZBLL) is not in use for speed, this because of two reasons, it has twice the number of cases of CLL and the algorithms that solves them are mostly long (the worst LL case of them all is in this group, it needs 16 HTM turns optimally). Another backdraw is that recognition for solving the edges before the corners is not so easy, you have to AUF to have a chance, sometimes even repeated AUFs.
It can however be useful for FMC. LLEF has a low average optimal solution length of 7.87, while for the last four corners it is 11.73 (a half move more than optimal PLL). Both of these can however be lowered. One can quite often choose a inversion/mirror version of an alg to solve the same LLEF situation thus increasing one's chances of cancelling move and/or getting a better corner case. Partial edge control can also be used to avoid the cases with four flipped edges. The corners can in turn be solved more efficiently with inserted corner 3cycles rather than at the very end of the solution.
Solving ELL first is 15 cases from a group of totally 48, i.e. a skip of this step occures 1:48 times, skip to EP occures 1:8 times and skip to pure EO occures 1:6 times.
See also:
Algorithms
Note that all of these algorithms are written in the Western notation, where a lowercase letter means a doublelayer turn and rotations are denoted by x, y, and z.
Click on an algorithm (not the camera icon) to watch an animation of it.
The images have corners solved in darker colours, this works as a guide for those who don't know the colour sheme or is using something diffrent from this. For all other reasons you can ignore the corners.
All edges oriented (EP)
Adjacent swap (Sune)

Opposite swap (TPLL)

Pure flips (EO)
2flip (Adjacent)

2flip (Opposite)
 
4flip

Adjacent swap
Adjacent RF

Adjacent FL
 
Adjacent LB

Adjacent BR
 
Opposite RF

Opposite BR
 
4flip (A4)

Opposite swap
Adjacent (OA)

Opposite (OO)
 
4flip (O4)

External Links