Algorithm Library

Essential CFOP algorithms — the highest-value cases to learn first. Not exhaustive.

T PermutationAdjacent Corner Swap

R U R' U' R' F R2 U' R' U' R U R' F'

Ua PermutationClockwise Edge Cycle

R U' R U R U R U' R' U' R2

Ub PermutationCounter-Clockwise Edge Cycle

R2 U R U R' U' R' U' R' U R'

H PermutationOpposite Edge Swap

M2 U M2 U2 M2 U M2

Z PermutationAdjacent Edge Swap

M2 U M2 U M' U2 M2 U2 M'

Aa PermutationCorner Cycle

x L2 D2 L' U' L D2 L' U L'