Difference between revisions of "NMCLL"
From Speedsolving.com Wiki
| Line 3: | Line 3: | ||
|image=NMCLL.png | |image=NMCLL.png | ||
|proposers=[[Gilles Roux]], [http://www.speedsolving.com/wiki/index.php?title=User:Athefre James Straughan] | |proposers=[[Gilles Roux]], [http://www.speedsolving.com/wiki/index.php?title=User:Athefre James Straughan] | ||
| − | |year= | + | |year=2004 |
|steps=1 | |steps=1 | ||
|algs=42 | |algs=42 | ||
Revision as of 20:47, 7 July 2012
| ||||||||||||||||||||||
NMCLL is the name given to the last layer of corners when the pieces don't match. While any recognition can be used, the traditional ways are difficult to use with all non-matching corner types. A recognition method has been developed specifically to solve this problem and works equally well with matching and non-matching corners. All of the same algorithms can be used, though memorization of two patterns per algorithm is required. Because of this, current CLL users are reluctant to relearn recognition and most Roux users almost exclusively use matching or opposite blocks. Currently, full NMCLL is more easily applied to 2x2 methods, such as CLL and EG, where the move count benefit makes much more of a difference.
