Difference between revisions of "L5E"
m 
m 

Line 1:  Line 1:  
−  '''L5E, Last Five edges''' is an experimental method that solves the last five [[edges]], four in U and one in the D layer.  +  '''L5E, Last Five edges''', is an experimental method that solves the last five [[edges]], four in U and one in the D layer. 
== Description ==  == Description == 
Revision as of 16:14, 26 July 2010
L5E, Last Five edges, is an experimental method that solves the last five edges, four in U and one in the D layer.
Contents
Description
There are two main subparts. First the edges are oriented using M'UM like in Roux; there are 5 cases for this, and the worst case in Roux (6 edges) is impossible. Then the edges must be permuted; you can place FD during orientation or right after and end with EPLL, or just permute all five edges in one step.
L5E can be useful for Corners First if the Eslice, centres and three FL edges are solved after the corners. It is also useful in any method that starts with columns, such as one which does the F2L pairs first and then finishes with CMLL, it is an alternative to the last step of Roux if the centres are placed together with the BD edge at first, also for any LBL style, cross minus one edge at first and then the LL corners have been finished with CLL or CMLL or the same for Fridrich with 2look OLL, corners first, then L5E orientation, place FD using (U) M' U2 M if it was not solved and end it all in PLL as usally.
Intermediate system
Intuitive:
This style is not completely intuitive, because it is still necessary to know EPLL. First orient all unoriented edges, then place the FD edge to its correct position and finally end the solve in EPLL. The necessary intuitive steps are:
 P = M' U2 M
 O = M' U M
 O' = M' U' M
Using that plus some U turns you can solve any case, even all ELL case. For example, O U P = (M' U M) U (M' U2 M) is a sample algorithm which solves orientation, then places FD. There is a 1 in 12 chance that EPLL is skipped; otherwise there is one algorithm left.
There is another notation which can make it shorter to write algorithms:
 F(moves) = F2 (moves) F2
It is important here that the moves inside the parentheses keep the corners solved, so that they will still be correct after this algorithm. An example is the Uperm, F(U P U) = F2 (U M' U2 M U) F2. F(O U') is a nice way to solve orientation and place FD all at once if the FD edge is in the middle of three unoriented edges in LL.
Using algorithms:
The intuitive style lets you find and understand the orientation algorithms yourself. Another approach is to learn the algorithms instead of finding them; the cases are:
Sometimes this will also solve the FD edge; the images show where the FD edge must be for the algorithm to solve it, but otherwise you should simply treat the yellow sticker as white. If you learn these positions, it can also be useful to learn the mirror algorithm for the case where FD is on the opposite side from the image. The easiest example is to use O' instead of O for the case with three flipped edges on U. Just like the intuitive step, if FD is not solved use P, and either way finish with EPLL.
Semiadvanced system
Orientation + FD placement
In many cases you can orient the edges and solve FD at the same time without using any more moves. However, for most cases the length of the algorithm is as long as the twostep process, so learning a separate algorithm would not help. Some good cases are:
 algorithm ... possibly optimized moves ... pieces to orient, location of FD
 M U F(U' M') ... M d R2 d' M' d R2 ... orients RU and FU, FD at UF.
 M U' F(U M') ... M d' L2 d M' d' L2 ... orients LU and FU, FD at UF.
 O U' O' ... (M' U M) U' (M' U' M) ... orients FU and BU, FD at UB
 M U 3x(M' U) M2 ... orients UF, UL, UB and DF without moving any pieces.
More algorithms will be added later.
FD placement + EPLL (L5EP)
Another possibility for improving the intermediate style is to permutate the last five edges in one step. This only requires 16 algorithms in total, so counting the 5 orientations creates a system that solves L5E in two short steps. Even if you know this, it is still useful to place FD without extra moves if possible, since EPLL recognition is very fast.
We will introduce the following function:
 f(moves) = f2 (moves) [U] f2 ... This is the same as the F() function above, but with double layer f turns. Note that sometimes the adjusting U turns are not mentioned.
Here are the algorithms for permutation of all 5 edges; make sure to use AUF to place the FD edge at the position it has in the image.

 

 

 

 

 



 

 



Advanced system
The most advanced system would be to simply solve in one step. Nobody has generated the algorithms for this yet, but it may not be a good idea because of the large number of cases and bad recognition. For the worst ones the algorithm will probably just be the same as in the 2step solution, so the benefit will be small at best.
One case where this is useful (and doable) is to solve cases where at least one of the edges is solved at the start. Using setup turns and ELL this can be done in one step, although the recognition and setup moves might mean that this is not worth doing.