CLL algorithms (3x3x3)

From Speedsolving.com Wiki
Revision as of 17:00, 8 September 2010 by Kenneth (talk | contribs) (→-S F)
This page is under construction!
One or more of our members are currently working on this page.
Come back in a few days and it will hopefully be completed by then.
CLL method
Information about the method
Proposer(s): Guus Razoux Schultz
Proposed: 1981
Alt Names:
Variants: COLL, CMLL
No. Steps: 1
No. Algs: 40 + 2
Avg Moves: ~
Purpose(s):

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 choise but the orginal method (CFCE) uses cross and F2L.

See also:


Algorithms

Note that all of these algorithms assume that you are right-hand dominant and know 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: This case and the T U case are actually the same because all corners are permuted and two of them are twisted in position. So if you orient the cube in the T-case x' y2 it will become this case. Then you can use the same allgorithm that only orients corners for both cases (Sune and mirror preserves everything exept the two corners).
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:

Alg R2 F' U F U' F' U' F2 R F' R
Alg (y2) R U R' U R U2 R2 U' R U' R' U2 R
Alg (y) R U2 R' U' R U' R' L' U2 L U L' U L

U D

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

Description: This is the case you solve using F R U R' U' F' (the shortest OLL), no other algs are needed for any of the methods that do not preserve LL edges orientation (exept EG 0/1). For COLL you will need something else.
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:

Alg (y') F R U R' U' F'
Alg !

U R

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

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

Algorithm:

Alg (y2) R2 D R' U2 R D' R' U2 R'

U F

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

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

Algorithm:

Alg R2 F2 R' B2 R F2 R' B2 R'

U L

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

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

Algorithm:

Alg (y2) L2 D' L U2 L' D L U2 L

U B

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

Description: !
Recognition: !

Algorithm:

Alg (y2) r' (y') R' U2 L' U R U' L U2 (y) r

T cases

T U

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

Description: Inverse of U U,
Recognition: !

Algorithm:

Alg F R' F R2 U' R' U' R U R' F2
Alg R U2 R' U' R U' R2 U2 R U R' U R
Alg (y') R U R' U R U2 R' L' U' L U' L' U2 L

T D

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

Description: !
Recognition: !

Algorithm:

Alg F2 L2 F' U R U' R' F L2 F2

T R

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

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

Algorithm:

Alg (y') r' U' R U L U' R' U

T F

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

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

Algorithm:

Alg (y') l' U2 R' D2 R U2 R' D2 R2 (x')

T L

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

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

Algorithm:

Alg (y) l U L' U' R' U L U' (x)

T B

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

Description: 2-cycle, self mirroring and self inverting.
Recognition: !

Algorithm:

Alg R' U R U2 L' R' U R U' L

L cases

L U

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

Description: Only orientation.
Recognition: !

Algorithm:

Alg R' U2 R U R' U F' L F' L' F2 R
Alg (y') R U R' U R U' R' U R U' R' U R U2 R'

L D

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

Description: 2-cycle,
Recognition: !

Algorithm:

Alg R U2 R2 F R F' R U2 R'

L R

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

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

Algorithm:

Alg (x') U' R U L' U' R' U r

L F

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

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

Algorithm:

Alg (y2) L' U2 L' D' L U2 L' D L2

L L

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

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

Algorithm:

Alg (y) R U2 R D R' U2 R D' R2

L B

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

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

Algorithm:

Alg (y' x') U L' U' R U L U' l'

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:

Alg (y') R U R' U R U2 R'
Alg L' U2 L U L' U L

S D

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

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

Algorithm:

Alg (y) R U R' U L' U R U' L U2 R'

S R

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

Description: !
Recognition: !

Algorithm:

Alg (y') L' U2 L U2 L F' L' F

S F

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

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

Algorithm:

Alg F R' F' R U2 R U2 R'

S L

Name: S L
Occurence: 4:162
Optimal moves: 0 HTM

Description: !
Recognition: !

Algorithm:

Alg !

S B

Name: S B
Occurence: 4:162
Optimal moves: 0 HTM

Description: !
Recognition: !

Algorithm:

Alg !

-S cases

-S U

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

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

Algorithm:

Alg (y2) L' U' L U' L' U2 L
Alg (y) R U2 R' U' R U' R'

-S D

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

Description: Mirror/inverse of S D
Recognition: !

Algorithm:

Alg L' U' L U' R U' L' U R' U2 L

-S R

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

Description: Inverse of S R,
Recognition: !

Algorithm:

Alg (y2) F' L F L' U2 L' U2 L

-S F

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

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

Algorithm:

Alg (y2) R U2 R' U2 R' F R F'

-S L

Name: -S L
Occurence: 4:162
Optimal moves: 0 HTM

Description: !
Recognition: !

Algorithm:

Alg !

-S B

Name: -S B
Occurence: 4:162
Optimal moves: 0 HTM

Description: !
Recognition: !

Algorithm:

Alg !

H cases

H U

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

Description: Only orientation.
Recognition: !

Algorithm:

Alg R U2 R' U' R U R' U' R U' R'

H D

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

Description: !
Recognition: !

Algorithm:

Alg r' U2 l2 (x) U2 r' U2 r U2 (x') l2 U2 r
Alg F R U R' U' R U R' U' R U R' U' F'

H R

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

Description: !
Recognition: !

Algorithm:

Alg !

H F

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

Description: !
Recognition: !

Algorithm:

Alg !

pi cases

pi U

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

Description: Only orientation.
Recognition: !

Algorithm:

Alg (y) R U2 R2 U' R2 U' R2 U2 R
Alg (x) U R' U2 L U2 R U2 L' U (x')

pi D

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

Description: !
Recognition: !

Algorithm:

Alg !

pi R

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

Description: !
Recognition: !

Algorithm:

Alg !

pi F

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

Description: !
Recognition: !

Algorithm:

Alg !

pi L

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

Description: !
Recognition: !

Algorithm:

Alg !

pi B

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

Description: !
Recognition: !

Algorithm:

Alg !