Difference between revisions of "Last Three Corners"
m (→External links: fixed a,an error) 
RedstoneTim (talk  contribs) m (Removed method category (because this is a last layer substep)) 

(One intermediate revision by one other user not shown)  
Line 7:  Line 7:  
subgroup=  subgroup=  
algs=24  algs=24  
−  moves=~10 [[HTM]]  +  moves=~10 [[HTM]], 9.56 optimal [[HTM]] 
purpose=<sup></sup>  purpose=<sup></sup>  
* [[Speedsolving]], [[FMC]], [[BLD]]  * [[Speedsolving]], [[FMC]], [[BLD]]  
Line 235:  Line 235:  
}  }  
−  +  [[Category:3x3x3 last layer substeps]]  
−  
−  [[Category:3x3x3 last layer  
−  
__NOTOC__  __NOTOC__ 
Latest revision as of 09:14, 3 June 2020

Last three corners, abbrevaited L3C (or 3LC), is a method that solves three of the last layer corners preserving all the rest, a sub group of L4C, ZBLL and ZZLL.
Usage: besides L4C, CxLL, ZBLL and ZZLL it is useful for FMC and the 3cycles are nice for Freestyle BLD. L3C is the final stage in the Snyder Method.
See also:
External links
 [1] Ryan Heise explains an intuitive approach to solve the last three corners.
L3C Cases
The group have 27 cases including solved, 3*3 orientations and 3 permutations. Most of the cases (18) are pure 3cycles, the rest are pure twists U, T, L, S and S. Some of the twist occures 2 times (U, T and L) and the Ttwist is the same as the Utwist if the puzzle is reoriented. Subtracting the duplicates and solved it will be 22 cases left. 16 of them are pure L3C cases and listed at this page, the rest are in one of two sub groups.
Sub groups
 Pure twists you can find at the Corner orientation page.
 Only permutation, see CPLL, corner permutation of the last layer.
The naming system used here is adapted to BLD, the ULB corner is always the solved one and URF is the 'buffer' with U as the buffer sticker. The piece in the buffer will go to two places, either URB or UFL and the sticker in U will go to any of the three stickers on each goal position and that sticker is in uppercase, the other two letters will be in lowercase. The second half of the name is the same but from the goal position of the first. The last piece will always go to the first buffer position so that will not be in the name.
Example: CW APLL is UflUrb and CCW APLL is UrbUfl.
Algorithms
Note that all of these algorithms are written in the Western notation, where a lowercase letter means a doublelayer turn and rotations are denoted by x, y, and z. (how to add algorithms) Click on an algorithm (not the camera icon) to watch an animation of it. 
The following four cases are mirror + inverses of the first so you only need '1 alg' for all. 
Mirror to the side and inverse in diagonal.  
uFlUrb

uRbUfl
 
UfluRb

UrbuFl
 
The following four cases are mirror + inverses of the first so you only need '1 alg' for all. 
Mirror to the side and inverse in diagonal.  
ufLuRb

urBuFl
 
uFlurB

uRbufL
 
The following four cases are mirror + inverses of the first so you only need '1 alg' for all. 
Mirror to the side and inverse in diagonal.  
ufLUrb

urBUfl
 
UflurB

UrbufL
 
ufLurB

urBufL
 
uFluRb

uRbuFl
