From Speedsolving.com Wiki
(Redirected from L5EP)
Alt Names: Last five edges
Variants: Sexy*+S(8355)n SexyM Beginner, Commutators (pseudo EF), L5EOP, L5EP
No. Algs: Unknown for 1 look, 5 for L5EO and 16 for L5EP
Avg Moves: about 14
Previous state: 5 Edges Missing cube state
Next state: Solved cube state

5 Edges Missing cube state -> L5E step -> Solved cube state

The L5E step is the step between the 5 Edges Missing cube state and the Solved cube state.

L5E, Last five edges, is an experimental method that solves five edges, the four in U and one in the D layer, preserving all other pieces.

ELL is a sub group of L5E, all ELL's may be solved in two steps using this method.


There are two main sub-parts. 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 using [U] M' U2 M (named 'P') and end with EPLL, or just permute all five edges in one step.

L5E can be useful for Corners First if the E-slice, 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 2-look OLL, corners first, then L5E orientation, place FD using P if it was not solved and end it all in PLL as usally.

Zipper L5E/L5E-FR

Zipper L5E or L5E-FR is used in the Zipper Method, specifically in Zipper-b. The difference between this variant and standard L5E is that instead of the FD edge, the FR edge is permuted. This approach, however, cannot be solved 2-Gen (with only M and U moves) like standard L5E.


Proposer(s): Kenneth Gustavsson
Proposed: 2010
Alt Names: EHKPLL
Variants: EPLL
No. Algs: 16
Avg Moves: ~7.37 STM
Previous state: unknown
Next state: unknown

Previous cube state -> L5EP step -> Next cube state

The L5EP step is the step between the Previous cube state and the Next cube state.

Last 5 Edges Permute, often abbreviated L5EP, is a 3x3 subset that solves the 4 U-layer edges and the down-front edge simultaneously while preserving all other pieces.

The five affected edges must be correctly oriented for L5EP to work. L5EP is often used in methods like Petrus-W and Portico, when there are only five edges left to solve on the cube.

There are 16 algorithms for L5EP, 10 excluding mirrors and 7 excluding mirrors and EPLL.

Any case can be simplified to an EPLL by moving the DF edge into the front and inserting it with M' U2 M. Intuitive L5EP can be used, but it is recommended to learn algorithmic L5EP due to the faster execution and low number of algorithms.


Although it is generally agreed upon that L5EP permutes the four U layer edges, the location of the fifth edge is not always clear. Because of that, multiple variants exist:

Standard L5EP (L5EP-DF): This is the original proposal by Kenneth Gustavsson where the UF, UR, UB, UL and DF edges are permuted simultaneously.

EHKPLL (L5EP-DR): EHKPLL is a subset of HKPLL which was invented for Hawaiian Kociemba. Here, the fifth permuted edge is the DR edge.

Zipper L5EP (L5EP-FR & L5EP-BR): This variant is used in the Zipper Method and permutes the U layer edges and either the FR or BR edge.

See also

External links

Intermediate system


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 U-perm, 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:

Basic orientations
FUL Solved.jpg
Intuitive solution

(Possibly optimised) alg

EO5 2 adjacent.jpg
O U2 O

(M' U M) U2 (M' U M)

Orients UL and UB.
EO5 2 opposite.jpg
O U' O

(M' U M) U' (M' U M)

Orients UF and UB.
EO5 4.jpg
P U2 O'

(M' U2 M) U2 (M' U' M)

Orients UR, UF, UL and UB
EO5 1.jpg
O U O'

(M' U M) U (M' U' M)

Orients FD and UB
EO5 3.jpg

(M' U' M)

Orients FD, UR, UF and UL
All images show white on top (U) and green in front (F).

More algs are at the L5EOP page

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.

Semi-advanced system

L5EOP is an alternative to L5E, that always solves the FD edge while orienting ('P'lace). Then the last step will always be EPLL.

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.

Double two cycle permutations
FUL Solved.jpg
Intuitive solution

(Possibly optimised) alg

EP5 22 A.jpg

(y') R U2 R2 U2 R2 U2 R

Swaps UF<->DF and UR<->UL
EP5 22 B1.jpg

(y') r2 U' 2x(M E2) U r2

Swaps UR<->DF and UL<->UB
EP5 22 B2.jpg

(y') r2 U 2x(M E2) U' r2

Swaps UL<->DF and UR<->UB
EP5 22 H.jpg

Ra U2 Ra' (y) Ra' U2 Ra

Swaps UR<->UL and UF<->UB
EP5 22 Z.jpg

M2 U' 2x(M E2) U M2

Swaps UR<->UB and UL<->UF
3-cycle permutations
EP5 3 A.jpg

(M' U2 M)

Cycles UF->DF->UB
EP5 3 B1.jpg
f(d' P)

(y') r2 U' (M' U2 M) U' r2

Cycles UL->UB->DF
EP5 3 B2.jpg
f(d P)

(y') r2 U (M U2 M') U r2

Cycles UR->UB->DF
EP5 3 U1.jpg

F2 U (M' U2 M) U F2

Cycles UF->UL->UR
EP5 3 U2.jpg

F2 U' (M' U2 M) U' F2

Cycles UF->UR->UL
5-cycle permutations
EP5 5 H1.jpg

(M' U2 M) U (M' U2 M)

Cycles UF->UL->UR->DF->UB
EP5 5 H2.jpg
P U' P

(M' U2 M) U' (M' U2 M)

Cycles UF->UR->UL->DF->UB
EP5 5 Z1.jpg

2x(M2 U) (M U2 M')

Cycles UF->UR->UB->UL->FD
EP5 5 Z2.jpg

2x(M2 U') (M U2 M')

Cycles UF->UL->UB->UR->DF
EP5 5 U1.jpg

(M' U2 M') U' (M' U2 M) U' M2

Cycles UF->DF->UB->UL->UR
EP5 5 U2.jpg

(M' U2 M') U (M' U2 M) U M2

Cycles UF->DF->UB->UR->UL
These images have white on top (U) and green in front (F). Darker pieces change positions.

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 2-step 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.

See also

External Links