# CLL algorithms (3x3x3)

 CLL Information Proposer(s): Guus Razoux Schultz Proposed: 1981 Alt Names: Variants: COLL, CMLL No. Steps: 1 No. Algs: 40 + 2 Avg Moves: 9.18 Purpose(s): Speedsolving, FMC

CLL 3x3x3, algorithms for the first last layer step of the CLL-ELL approach. This step preserves the first two layers but not the last layer edges. How you solve F2L is a matter of choice but the original method (CFCE) uses cross and F2L.

 CLL

# Algorithms

 Note that all of these algorithms are written in the Western notation, where a lowercase letter means a double-layer 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.

See CxLL for information about the diagrams.

The first alg given for each case is optimal in Half Turn Metric, please do not add algs on top of them, insert your contributions at the bottom of the list(s).

## U cases

### U U

Name: U U
Occurence: 4:162
Optimal moves: 11 HTM

Description: Only orientation. This case and the T U case are actually the same because all corners are permuted and two of them are twisted in position. Orient the T-case x' y2 and it will become this case.
Recognition: For all U cases look at two "bars" of stickers, one at Fur-Ful and one at Urb-Ulb, at the F-side it is one single colour and in the U-face there are two opposite colours.

Algorithm:

 CLL R2 F' U F U' F' U' F2 R F' R [X]
 CLL R' U' R U' R' U2 R2 U R' U R U2 R' [X]
 CLL (y2) R U R' U R U2 R2 U' R U' R' U2 R [X]
 CLL (y) R U2 R' U' R U' R' L' U2 L U L' U L [X]
 CLL (x) R D' R' U R' U R' D R U' R U' (x') [X]

### U D

Name: U D
Occurence: 4:162
Optimal moves: 6 HTM

Description: 2-cycle, self mirror and self inverse. This is the case you solve using F R U R' U' F' (the shortest OLL).
Recognition: For all U cases you look at two "bars" of stickers, one at Fur-Ful and one at Urb-Ulb, at the F-side there are two opposite colours and in the U-face it is one single colour.

Algorithm:

 CLL (y') F R U R' U' F' [X]

### U R

Name: U R
Occurence: 4:162
Optimal moves: 9 HTM

Description: Mirror of U L, inverse of L L,
Recognition: !

Algorithm:

 CLL (y2) R2 D R' U2 R D' R' U2 R' [X]
 CLL (x') R U' R' D R U2 R' D' R U' R' (x) [X]

### U F

Name: U F
Occurence: 4:162
Optimal moves: 9 HTM

Description: Self mirroring, inverse of T F,
Recognition: !

Algorithm:

 CLL R2 F2 R' B2 R F2 R' B2 R' [X]
 CLL (x') R2 D2 R' U2 R D2 R' U2 R' (x) [X]

### U L

Name: U L
Occurence: 4:162
Optimal moves: 9 HTM

Description: Mirror of U R, inverse of L F
Recognition: !

Algorithm:

 CLL (y2) L2 D' L U2 L' D L U2 L [X]
 CLL R2' D' R U2 R' D R U2 R [X]

### U B

Name: U B
Occurence: 4:162
Optimal moves: 10 HTM

Description: 2-cycle, self mirror and self inverse.
Recognition: !

Algorithm:

 CLL (y2) r' (y') R' U2 L' U R U' L U2 (y) r [X]
 CLL B' R' U2 L' U R U' L U2 B [X]
 CLL (y) R' U L U' R U2 F U' F' L' [X]

## T cases

### T U

Name: T U
Occurence: 4:162
Optimal moves: 11 HTM

Description: Inverse of U U,
Recognition: !

Algorithm:

 CLL F R' F R2 U' R' U' R U R' F2 [X]
 CLL R U2 R' U' R U' R2 U2 R U R' U R [X]
 CLL (y') R U R' U R U2 R' L' U' L U' L' U2 L [X]
 CLL (y2 x') U' R U' R D R' U R' U R' D' R (x) [X]

### T D

Name: T D
Occurence: 4:162
Optimal moves: 10 HTM

Description: 2-cycle, self mirror and self inverse.
Recognition: !

Algorithm:

 CLL F2 L2 F' U R U' R' F L2 F2 [X]
 CLL (y2) F2 L2 F' R U R' U' F L2 F2 [X]
 CLL R2' U' R F R' U R2 U' R' F' R [X]

### T R

Name: T R
Occurence: 4:162
Optimal moves: 8 HTM

Description: Mirror of T L, inverse of L R,
Recognition: !

Algorithm:

 CLL (y') r' U' R U L U' R' U (x) [X]
 CLL (y') R' U' R U l U' R' U (x) [X]
 CLL (y) L' U' L U r U' L' U (x') [X]
 CLL (y) l' U' L U R U' r' F [X]

### T F

Name: T F
Occurence: 4:162
Optimal moves: 9 HTM

Description: Self mirroring, Inverse of U F,
Recognition: !

Algorithm:

 CLL (y') l' U2 R' D2 R U2 R' D2 R2 (x') [X]
 CLL (y x') R U R' D R U' R U' R' U R' D' (x) [X]

### T L

Name: T L
Occurence: 4:162
Optimal moves: 8 HTM

Description: Mirror of T R, inverse of L L,
Recognition: !

Algorithm:

 CLL (y) l U L' U' R' U L U' (x) [X]
 CLL (y') R U R' U' l' U R U' (x') [X]
 CLL (y') R U R' U' R' F R F' [X]
 CLL (y') r U R' U' r' F R F' [X]

### T B

Name: T B
Occurence: 4:162
Optimal moves: 10 HTM

Description: 2-cycle, self mirror and self inverse.
Recognition: !

Algorithm:

 CLL R' U R U2 L' R' U R U' L [X]
 CLL (y2) R U' R' U2 L R U' R' U L' [X]
 CLL (x) U R U' L U R2 U R U2 r' [X]
 CLL (z) D' R D R2 U' D' R D R' U (z') [X]

## L cases

### L U

Name: L U, Triple Sune
Occurence: 4:162
Optimal moves: 11 HTM

Description: Only orientation.
Recognition: !

Algorithm:

 CLL L B' D2 B L' U2 L B' D2 B L' [X]
 CLL R' U2 R U R' U F' L F' L' F2 R [X]
 CLL (y') R U R' U R U' R' U R U' R' U R U2 R' [X]
 CLL (y') R U2 R' U' R U R' U' R U R' U' R U' R' [X]
 CLL (y2) R' U' R U' R' U R U' R' U R U' R' U2 R [X]

### L D

Name: L D
Occurence: 4:162
Optimal moves: 9 HTM

Description: 2-cycle, self mirror and self inverse.
Recognition: !

Algorithm:

 CLL (y) R U2 R2 F R F' R U2 R' [X]
 CLL (x') R' F2 R2 U' R' U R' F2 R (x) [X]

### L R

Name: L R
Occurence: 4:162
Optimal moves: 8 HTM

Description: Mirror of L B, inverse of T R,
Recognition: !

Algorithm:

 CLL (x') U' R U L' U' R' U r [X]
 CLL (y) F R U' R' U' R U R' F' [X]
 CLL (y2) F' r U R' U' r' F R [X]

### L F

Name: L F
Occurence: 4:162
Optimal moves: 9 HTM

Description: Mirror of L L, inverse of U L,
Recognition: !

Algorithm:

 CLL (y2) L' U2 L' D' L U2 L' D L2 [X]
 CLL R' U2 R' D' R U2 R' D R2 [X]

### L L

Name: L L
Occurence: 4:162
Optimal moves: 9 HTM

Description: Mirror of L F, Inverse of U R
Recognition: !

Algorithm:

 CLL (y) R U2 R D R' U2 R D' R2 [X]
 CLL (y' x') R U R' D R U2 R' D' R U R' (x) [X]

### L B

Name: L B
Occurence: 4:162
Optimal moves: 8 HTM

Description: Mirror of L R, inverse of T L,
Recognition: !

Algorithm:

 CLL (y' x') U L' U' R U L U' l' [X]
 CLL (y) F R' F' R U R U' R' [X]
 CLL (y) F l' U' L U R U' r' [X]

## S cases

### S U

Name: S U, Sune
Occurence: 4:162
Optimal moves: 7 HTM

Description: Only orientation, mirror/inverse of -S U
Recognition: !

Algorithm:

 CLL (y') R U R' U R U2 R' [X]
 CLL L' U2 L U L' U L [X]

### S D

Name: S D
Occurence: 4:162
Optimal moves: 11 HTM

Description: Mirror/inverse of -S D
Recognition: !

Algorithm:

 CLL (y) R U R' U L' U R U' L U2 R' [X]
 CLL (y2) L' U' B L' B' L U' L U L' U L [X]

### S R

Name: S R
Occurence: 4:162
Optimal moves: 8 HTM

Description: Mirror of -S F, inverse of -S R.
Recognition: !

Algorithm:

 CLL (y') L' U2 L U2 L F' L' F [X]
 CLL (y') r' F2 r U2 r U' r' F [X]

### S F

Name: S F
Occurence: 4:162
Optimal moves: 8 HTM

Description: Mirror of -S R, inverse of -S F.
Recognition: !

Algorithm:

 CLL (y') F R' F' R U2 R U2 R' [X]

### S L

Name: S L, Anti Niklas
Occurence: 4:162
Optimal moves: 10 HTM

Description: Mirror/inverse of -S B.
Recognition: !

Algorithm:

 CLL B L' U2 L B' L' B U2 B' L [X]
 CLL (x') U L' F2 L U' L' U F2 U' r [X]
 CLL (x) D R2 D2 R U2 R' D2 R U2 R D' (x') [X]
 CLL (y) R2' D' R U' R' D R U' R U R' U R [X]
 CLL (y2) F R' U2 R F' R' F U2 F' R [X]

### S B

Name: S B, Niklas
Occurence: 4:162
Optimal moves: 7 HTM

Description: Mirror/inverse of -S L.
Recognition: !

Algorithm:

 CLL (y') R U' L' U R' U' L [X]
 CLL (y) L U' R' U L' U' R [X]

## aS cases

### -S U

Name: -S U, Antisune
Occurence: 4:162
Optimal moves: 7 HTM

Description: Only orientation, Mirror/inverse of S U
Recognition: !

Algorithm:

 CLL R' U' R U' R' U2 R [X]
 CLL (y) R U2 R' U' R U' R' [X]
 CLL (y2) L' U' L U' L' U2 L [X]

### -S D

Name: -S D
Occurence: 4:162
Optimal moves: 11 HTM

Description: Mirror/inverse of S D
Recognition: !

Algorithm:

 CLL L' U' L U' R U' L' U R' U2 L [X]
 CLL L' U' L U' L F' L' F L' U2 L [X]
 CLL (y2) R' U' R U' R B' R' B R' U2 R [X]

### -S R

Name: -S R
Occurence: 4:162
Optimal moves: 8 HTM

Description: Mirror of S F, inverse of S R,
Recognition: !

Algorithm:

 CLL (x') M' U' R U L' U2 R' U2 R [X]
 CLL (y2) F' L F L' U2 L' U2 L [X]
 CLL (y x') R' D R U' R2' D' R2 U (x) [X]

### -S F

Name: -S F
Occurence: 4:162
Optimal moves: 8 HTM

Description: Mirror of S R, inverse of S F.
Recognition: !

Algorithm:

 CLL L U2 L' U2 r' U L U' (x) [X]
 CLL (y2) R U2 R' U2 R' F R F' [X]
 CLL (y x') D R2 U' R2' D' R U R' (x) [X]

### -S L

Name: -S L, Niklas
Occurence: 4:162
Optimal moves: 7 HTM

Description: Mirror/inverse of S B.
Recognition: !

Algorithm:

 CLL R' U L U' R U L' [X]

### -S B

Name: -S B, Anti Niklas
Occurence: 4:162
Optimal moves: 10 HTM

Description: Mirror/inverse of S L.
Recognition: !

Algorithm:

 CLL L' B U2 B' L B L' U2 L B' [X]
 CLL (y) R' U' R U' R' U R' D' R U R' D R2 [X]
 CLL (y2) R' F U2 F' R F R' U2 R F' [X]

## H cases

### H U

Name: H U, Double Sune
Occurence: 2:162
Optimal moves: 11 HTM

Description: Only orientation.
Recognition: !

Algorithm:

 CLL R U2 R' U' R U R' U' R U' R' [X]

### H D

Name: H D, Triple FRURUF
Occurence: 2:162
Optimal moves: 11 HTM

Description: 2-cycle, self mirror and self inverse.
Recognition: !

Algorithm:

 CLL F (R U R' U')3 F' [X]
 CLL r' U2 l2 (x) U2 r' U2 r U2 (x') l2 U2 r [X]

### H R

Name: H R / H L
Occurence: 4:162
Optimal moves: 11 HTM

Description: Inverse of pi B.
Recognition: !

Algorithm:

 CLL (y') R U2 R2 F R F' U2 R' F R F' [X]

### H F

Name: H F / H B
Occurence: 4:162
Optimal moves: 10 HTM

Description: Inverse of pi F.
Recognition: !

Algorithm:

 CLL R' F R F' U2 R2 B' R' B R' [X]
 CLL R' F R F' U2 l2 F' l' U l' [X]
 CLL R' F R F' U' F R' F' R2 U' R' [X]

## pi cases

### pi U

Name: pi U, Bruno
Occurence: 4:162
Optimal moves: 9 HTM

Description: Only orientation.
Recognition: !

Algorithm:

 CLL (y) R U2 R2 U' R2 U' R2 U2 R [X]
 CLL (y) F (R U R' U')2 F' [X]
 CLL (x) U R' U2 L U2 R U2 L' U (x') [X]

### pi D

Name: pi D
Occurence: 4:162
Optimal moves: 10 HTM

Description: 2-cycle, self mirror and self inverse.
Recognition: !

Algorithm:

 CLL (y') R' U' R U' R' U F' U F R [X]
 CLL (y') R U R' U R d' R U' R' F' [X]
 CLL R U2 L' d L U2 L' d' L U2 R' [X]
 CLL (y') R' U' R U' R' d R' U R B [X]

### pi R

Name: pi R
Occurence: 4:162
Optimal moves: 11 HTM

Description: Mirror/Inverse of pi L.
Recognition: !

Algorithm:

 CLL (y2) F' U' L' U L2 F L' U2 L' U2 L [X]
 CLL (y) R U2 R' U' R U R' U2 R' F R F' [X]
 CLL (x') D R2 U' R' U R U' R2' D' R U R' (x) [X]

### pi F

Name: pi F
Occurence: 4:162
Optimal moves: 10 HTM

Description: Inverse of H F.
Recognition: !

Algorithm:

 CLL (y) R B' R B R2 U2 F R' F' R [X]
 CLL (y) R U' L' U R' U L U L' U L [X]

### pi L

Name: pi L
Occurence: 4:162
Optimal moves: 11 HTM

Description: Mirror/Inverse of pi R.
Recognition: !

Algorithm:

 CLL (y2) F U R U' R2 F' R U2 R U2 R' [X]
 CLL (y') L d R U' R2 F' R U2 R U2 R' [X]
 CLL (y') L' U2 L U L' U' L U2 L F' L' F [X]
 CLL (y x') R U R' D R U' R U' R2' D' R U R' (x) [X]

### pi B

Name: pi B
Occurence: 4:162
Optimal moves: 11 HTM

Description: Inverse of H R.
Recognition: !

Algorithm:

 CLL (y') F R' F' R U2 F R' F' R2 U2 R' [X]
 CLL