There are 24 different algorithms: 3 positions for the corner and for each corner 4 locations for the edge (front, right, back and left) and again 2 positions (set/unset). 3 x 4 x 2. To ease the access, we consider 3 groups of algorithms federated by the spin position of the corner.
Naming:
edge front, top sticker like front center
![]() |
F' U F U' d' F U F' y' | ![]() |
![]() |
---|
edge front, top sticker like right center
![]() |
U F' U F U' F' U' F | ![]() |
![]() |
---|
edge left, top sticker like front center
![]() |
U' R U2 R' U' R U2 R' | ![]() |
![]() |
---|
edge left, top sticker like right center
![]() |
F' U' F | ![]() |
![]() |
---|
edge back, top sticker like front center
![]() |
U' R U R' U' R U2 R' | ![]() |
![]() |
---|
edge back, top sticker like right center
![]() |
U F' U' F U' F' U' F | ![]() |
![]() |
---|
edge right, top sticker like front center
![]() |
U R U' R' | ![]() |
![]() |
---|
edge right, top sticker like right center
![]() |
U' R U2 R' U F' U' F | ![]() |
![]() |
---|