# Difference between revisions of "LLEF"

 LLEF Information Proposer(s): unknown Proposed: unknown Alt Names: none Variants: ELL, EOLL, EPLL Subgroup: No. Algs: 15 Avg Moves: 7.87 (Optimal HTM) Purpose(s): Speedsolving, FMC Previous state: F2L cube state Next state: LL:EO+EP cube state
 The LLEF step is the step between the F2L cube state and the LL:EO+EP cube state.

LLEF (Last Layer Edges First) is a variation of ELL (Edges of the Last Layer) that ignores corners is easier to solve; it uses both fewer moves and has fewer cases than what is the 'normal ELL'. This variation is useful for a 2-look method that solves corners last (see L4C). But L4C is not in use for speed solving, because of two reasons, it has twice the number of cases of CLL and the algorithms that solve them are mostly long (the worst LL case of all is in this group, it needs 16 turns optimally (HTM)). Another backdraw is that recognition for solving the edges before the corners is not so easy. If you don't have a system for colour recognition you have to AUF to have a chance, sometimes even repeated AUFs.

LLEF can also be useful for a 3LLL method known as BLL. This method has a total of 24 algorithms and an average total of 27 moves.

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 moves 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 3-cycles 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 only occures 1:8 times and skip to pure EO occures 1:6 times.