Difference between revisions of "COLL"
m (→External links: clean up) |
m (→External links: clean up) |
||
Line 38: | Line 38: | ||
[[Category:3x3x3 methods]] | [[Category:3x3x3 methods]] | ||
[[Category:3x3x3 last layer methods]] | [[Category:3x3x3 last layer methods]] | ||
− | + | ||
[[Category:Abbreviations]] | [[Category:Abbreviations]] | ||
[[Category:Sub Steps]] | [[Category:Sub Steps]] |
Revision as of 19:54, 19 May 2012
|
COLL (an abbreviation for Corners of Last Layer) is a method in the CxLL group that solves the Last Layer corners in one algorithm, while preserving the F2L and the orientation of the LL edges. So, after the COLL step, only edge permutation (EPLL) is left. COLL requires learning 40 algorithms (42 if you include T-Perm and Y-Perm and 24 if you exclude mirrors).
COLL is not to be confused with CLL, which is an abbreviation for exactly the same name. The difference is that CLL preserves the F2L but not the last layer edges orientation, so it leaves the LL edges scrambled and the next step would be full ELL. For some cases the CLL and the COLL are the same algorithm, but for other cases the CLL is much shorter. For CLL and COLL algorithms, see the page on CxLL Algorithms.
One possible extension of COLL is ZBLL. This LL method solves the entire LL if the edges are already oriented, but it has almost 500 cases. Another one is OLLCP which solves the corner permutation and orients the last layer with a total of over 300 algorithms for all last layer cases.
See also
External links
- COLL Algorithms By Lars Vandenbergh
- COLL Algorithms By Leyan Lo
- Bob Burton's COLL Page
- Jason Baum's COLL Page
- Dan Cohen's COLL Page