CLL algorithms (2x2x2)

From Speedsolving.com Wiki
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 (2x2x2)

U cases | T cases | L cases | S cases | -S cases | H cases | pi cases | edit


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.

U cases

Name: U
Occurence:
Optimal moves:  ? HTM

Description:
Recognition: bar on top and bar on the side

Algorithm:

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


T cases

Name: T
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL [1]
CLL [2]
CLL [3]
CLL [4]
CLL [5]


L cases

Name: L
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL [6]
CLL [7]
CLL [8]
CLL [9]
CLL [10]


S cases

Name: S
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL [11]
CLL [12]
CLL [13]
CLL [14]
CLL [15]


-S cases

Name: -S
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL [16]
CLL [17]
CLL [18]
CLL [19]
CLL [20]


H cases

Name: H U
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL y2 x R2 U R2 U2 y' R2 U R2
CLL y2 x' R2 U' R2 U2 y R2 U' R2
CLL x' R2 U' R2 U2 F2 U' R2
CLL y2 R2 F U2 F2 R2 F R2
CLL x R2 U R2 U2 F2 U F2
CLL y F2 L U2 L2 F2 L F2
CLL x' R2 U F2 U2 R2 U R2
CLL R2 F R2 F2 U2 F R2
CLL y' F2 R' F2 R2 U2 R' F2
CLL x R2 U' F2 U2 R2 U' F2
CLL x R2 U R2 U2 B2 U R2
CLL y' F2 R U2 R2 F2 R F2
CLL x R2 U R2 U2 x' U2 F R2
CLL R2 F R2 B2 U2 B R2
CLL y2 x R2 U R2 U D R2 U R2
CLL y' F2 R U2 R' L' U2 L F2
CLL y B2 L' D' B2 R2 B2 D L B2
CLL y2 R U' F' U R' F R' U' R' U' F'
CLL y' F R' U' F U' R F' R' F' U' R'
CLL R U F R F R' U F' U R F'
CLL y F R U R U F' R F' R F R'
CLL x R U F' U R' U2 F' R U' R F
CLL y' R' F2 R2 U2 R' F2 R U2 R2 F2 R
CLL y' l U2 R2 F2 R U2 R' F2 R2 U2 R'
CLL y' L U2 L2 B2 R D2 L' D2 L2 B2 R'
CLL y F2 L B2 L' F2 U2 F2 R D2 R' F2
CLL y' z R U' R F R' U F' U R U R F
CLL y' z R U R F R F U' F R' U R F'
CLL y F R U R' U' R U R' U' R U R' U' F'


Name: H D
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL [21]


Name: H R
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL [22]


Name: H F
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL [23]


pi cases

Name: pi
Occurence:
Optimal moves:  ? HTM

Description:
Recognition:

Algorithm:

CLL [24]
CLL [25]
CLL [26]
CLL [27]
CLL [28]



CLL (2x2x2)

U cases | T cases | L cases | S cases | -S cases | H cases | pi cases | edit

See also:

This page is a DNF (incomplete).
Please help by expanding it.
There may be suggestions on its talk page.