MagicVince
Member
Hello,
As discussed in another thread, I am trying to do a mapping of the different methods to solve the Last Layer (after F2L). My sources are mainly the discussions in this forum and the wiki of this website.
Here are the results so far.
1LLL : one-look last layer. Directly solves any last layer scramble in one single algorithm.
2LLL: two-look last layer. There different methods.
- OLL + PLL (Orient Last Layer followed by Permute Last Layer). This is certainly the most known one, part of CFOP (Cross, First two layers, OLL, PLL). The recognition of the cases is probably easier than for the following methods. OLL algorithms can possibly permute the cubies while orienting them, while PLL does not affect the already solved orientations.
- CLL + ELL (Corner of Last Layer followed by Edges of Last Layer). This is probably the second best known method. CLL can have side effects on edges while adjusting the corners, whereas ELL solves the edges and leaves the corners unchanged.
- LLEF + L4C (Last Layer Edges First followed by Last Four Corners). Basically the contrary of the previous one. LLEF can disturb the corners while adjusting the edges whereas L4C solves the corners and keeps the edges unchanged.
- CPEOLL + 2GLL (Corner Permute and Edge Orient Last Layer followed by Two-Gen Last Layer). A more exotic method. The advantage is that the last step only uses 2-gen algorithms (ex. RU).
- COLL + EPLL (Corner Of Last Layer followed by Edge Permute Last Layer) is sometime considered as a 2LLL if edges orientations was fixed during F2L. COLL permute and orient corners while preserving edge orientation but can possibly permute them, since EPLL comes after and fixes edge permutation only.
3LLL and 4LLL: three-look and four-look Last Layer. Most of the two sub-phases of a 2LLL method can be decomposed into two, leading to 3LL or 4LL.
- OLL can be decomposed into EOLL + OCLL (Edge Orient Last Layer followed by Orient Corner of Last Layer).
- ELL can be decomposed into EOLL preserving corners + EPLL (Edge Orient Last Layer preserving corners followed by Edge Permute Last Layer).
- L4C can be decomposed into OCLL-EPP + CPLL (Orient Corner Last Layer Edge Preserved followed by Edge Permute Last Layer).
Some methods have a step that includes 3 actions:
- EOLL + ZBLL (Edge Orientation followed by Zborowski-Bruchem Last Layer). Once again, EOLL can be included into the F2L phase and in this case, ZBLL becomes a one-look Last Layer that solves corners while permuting edges in a single step.
- OLLCP + EPLL (Orient Last Layer and Corner Permute followed by Edge Permutation of Last Layer). OLLCP does 3 things: orient edges, orient corners and permute corners. The second step fixes what remains, that is edge permutation.
Please have a look at the following graph:
Questions:
- Do you spot any mistake?
- I have a doubt on OCLL-EPP: EPP should mean Edge Permutation Preserved. But L4C needs not only the permutation but also the orientation of the edges being preserved. Is it the correct naming?
- You can see in the graph several arrows with no name. Is there a standard (or at least a suggested) naming for those steps? Or are they just never used (I will remove the arrow in this case)?
- The "CPLL subset" I mentioned is only 2 algs (ex: Y-perm and T-perm) whereas CPLL is 4 algs. Is there a name for this subset (adjacent and diagonal corner swap)?
- More important: did I missed some methods?
Thanks,
Vince.
As discussed in another thread, I am trying to do a mapping of the different methods to solve the Last Layer (after F2L). My sources are mainly the discussions in this forum and the wiki of this website.
Here are the results so far.
1LLL : one-look last layer. Directly solves any last layer scramble in one single algorithm.
2LLL: two-look last layer. There different methods.
- OLL + PLL (Orient Last Layer followed by Permute Last Layer). This is certainly the most known one, part of CFOP (Cross, First two layers, OLL, PLL). The recognition of the cases is probably easier than for the following methods. OLL algorithms can possibly permute the cubies while orienting them, while PLL does not affect the already solved orientations.
- CLL + ELL (Corner of Last Layer followed by Edges of Last Layer). This is probably the second best known method. CLL can have side effects on edges while adjusting the corners, whereas ELL solves the edges and leaves the corners unchanged.
- LLEF + L4C (Last Layer Edges First followed by Last Four Corners). Basically the contrary of the previous one. LLEF can disturb the corners while adjusting the edges whereas L4C solves the corners and keeps the edges unchanged.
- CPEOLL + 2GLL (Corner Permute and Edge Orient Last Layer followed by Two-Gen Last Layer). A more exotic method. The advantage is that the last step only uses 2-gen algorithms (ex. RU).
- COLL + EPLL (Corner Of Last Layer followed by Edge Permute Last Layer) is sometime considered as a 2LLL if edges orientations was fixed during F2L. COLL permute and orient corners while preserving edge orientation but can possibly permute them, since EPLL comes after and fixes edge permutation only.
3LLL and 4LLL: three-look and four-look Last Layer. Most of the two sub-phases of a 2LLL method can be decomposed into two, leading to 3LL or 4LL.
- OLL can be decomposed into EOLL + OCLL (Edge Orient Last Layer followed by Orient Corner of Last Layer).
- ELL can be decomposed into EOLL preserving corners + EPLL (Edge Orient Last Layer preserving corners followed by Edge Permute Last Layer).
- L4C can be decomposed into OCLL-EPP + CPLL (Orient Corner Last Layer Edge Preserved followed by Edge Permute Last Layer).
Some methods have a step that includes 3 actions:
- EOLL + ZBLL (Edge Orientation followed by Zborowski-Bruchem Last Layer). Once again, EOLL can be included into the F2L phase and in this case, ZBLL becomes a one-look Last Layer that solves corners while permuting edges in a single step.
- OLLCP + EPLL (Orient Last Layer and Corner Permute followed by Edge Permutation of Last Layer). OLLCP does 3 things: orient edges, orient corners and permute corners. The second step fixes what remains, that is edge permutation.
Please have a look at the following graph:
Questions:
- Do you spot any mistake?
- I have a doubt on OCLL-EPP: EPP should mean Edge Permutation Preserved. But L4C needs not only the permutation but also the orientation of the edges being preserved. Is it the correct naming?
- You can see in the graph several arrows with no name. Is there a standard (or at least a suggested) naming for those steps? Or are they just never used (I will remove the arrow in this case)?
- The "CPLL subset" I mentioned is only 2 algs (ex: Y-perm and T-perm) whereas CPLL is 4 algs. Is there a name for this subset (adjacent and diagonal corner swap)?
- More important: did I missed some methods?
Thanks,
Vince.
Last edited: