OSPA Orientation Algorithms. I have only included algs with the fewest number of moves. It's possible that longer algs could be faster to execute. Many of these algorithms could be further optimized by doing it from a different angle. The final move can always be inverted and it will still work. Keep this in mind when planning ahead to the next step. Overall this step probably averages about 4.5 moves, with a maximum of 6 moves.
The following 7 cases are used when the bottom layer is already oriented. Your normal OLL algs will work fine as well. [avg moves: 5]
| Bottom → Top ↓ |
All Oriented |
![]() |
R', U2, F2, U, R R2, U', F, U', R F2, U2, R, F', R |
![]() |
R, U2, F2, U', F R2, U, F', R, F F2, U2, R', F, R |
![]() |
R', U', F2, U, R R2, F, U', F, R R2, F', U', F, R F, R, U2, R', F F2, R, U, F', R F2, R', U, F', R |
![]() |
R2, U2, R |
![]() |
R, U2, R', F2, U', F R', F2, R, F2, U, F R2, U, F, U', R, F R2, U, F', U', R, F R2, U', R, F, U', R R2, U', R', F, R', F R2, F, U2, F', R2, F R2, F', R2, F, R2, F F, U, R, U, R', F F, U, R', U, R', F F, U', F, R', U, F F, U', F', R', F, R F', U, F, R, U', R F', U, F', R, F', R F', U', R, F', U, F F', U', R', F', R, F |
![]() |
F, R2, F, U2, F F', U2, F', U2, F |
![]() |
R, U2, F2, R2, U', F R, F, U', R2, F2, R R, F', R2, F2, U, R R', U2, F2, R2, U, F R', F, U2, F2, R', F R', F', R, F2, U2, F R2, U, F2, R', U2, R R2, U', F2, R, F2, R |
These 16 algorithms are used in the Guimond method. I haven't generated any algs for these cases because the ones listed elsewhere are probably superior.
The following 7 cases are used when the two unoriented pieces of the bottom layer form a bar on the side. [avg moves: 4.43]
| Bottom → Top ↓ |
![]() |
![]() |
R', F, R2, F |
![]() |
R, F', U2, F |
![]() |
R', U, R2, U', R R2, U', R', U2, R R2, F', U, F, R |
![]() |
R, U2, R2, U, R R', U2, R2, U', R |
![]() |
R2, F, R2, F |
![]() |
U2, F2, R2, F |
![]() |
R, U2, F', U2, F R', U2, F, R2, F' |
These 7 algorithms are used when neither of the 2 unoriented pieces on the bottom layer are pointing to the side. [avg moves: 3.71]
| Bottom → Top ↓ |
![]() |
![]() |
U', R', F2, U', F |
![]() |
U2, R, F2, U, R |
![]() |
U', R, F, R, F U2, R', F', U', F |
![]() |
F, R, F, U', F F, R', F, U', F F', U, F', U, R F', U', F', U, R |
![]() |
R |
![]() |
F2, R, F2, R |
![]() |
F2, U2, F, R |
For these remaining 16 cases, you have 2 unoriented pieces on the bottom layer, and only one of them points to the side. [avg moves: 4.5]
| Bottom → Top ↓ |
![]() |
Bottom → Top ↓ |
![]() |
![]() |
F, U', R | ![]() |
F', R, F |
![]() |
R, F2, R2, U, F R', U', F2, R2, F F, U', F, R', F F2, U2, R2, U, F |
![]() |
R, U', F, U', R R2, U2, F2, U, R F, R2, F2, U, F F', U', F2, R2, F |
![]() |
R, U', R', U2, R R, F', U, F, R R2, U, R2, U', R F, U, R', U2, R F', U', F2, U', R |
![]() |
R', U, R, U2, R R', F, R', F', R R2, U', R2, U, R F, R, F2, R, F F', R', F, R2, F |
![]() |
R, U, F, R, F R, U', F, R, F R', U, F, R, F R', U', F, R, F |
![]() |
R, U, F', U', F R, U', F', U', F R', U, F', U', F R', U', F', U', F |
![]() |
R, F, R2, F F, R', U', R |
![]() |
U', R', F', U2, F U', F', U, R, F F, R2, F', R |
![]() |
R, U, R', U2, R R2, F, U2, R', F |
![]() |
R, U2, R, U', R R', U2, R, U', R |
![]() |
U, R, F2, U2, F U', F2, U2, R', F |
![]() |
U, F2, U2, R, F U', R', F2, U2, F |
![]() |
R, U', R2, U', R R', U', R2, U', R F, R', F2, U', F F2, U', F, U2, R F2, U', F', U2, R |
![]() |
R, U, R2, U, R R', U, R2, U, R F', U, F2, R, F F2, U, R, U2, F F2, U, R', U2, F |