OC, two or three corners (Grant)

F2L is solved and the U edges are oriented. At most three U corners need orientation. This is a subset of CO. Orient two or three last-layer corners.

8 cases · 67 algorithms

No proven optimum for this set: the page gives the length of the shortest algorithm offered and a lower bound.

Definition of the set: Grant.

How to read this page

Each case is seen from above: the top face in the middle, the top layer's stickers on its sides, the front face at the bottom.
Colours of the puzzle in the application. Grey marks what the case does not look at.
Lengths: each move counts 1, an inner slice 2, a rotation 0. The "setup" presents the puzzle as drawn and does not count.
In each case, the best available optimal algorithm comes first, then the others by increasing ease score. When no optimal writing is available, all algorithms are ranked by this score (lower is easier).
"Play" starts from a position of the case and runs the algorithm to the set’s goal. Usually, the starting position is obtained by running the algorithm backwards from the solved puzzle. For a partial goal, the player may start from a representative position of the case in the application; the puzzle is not necessarily fully solved at the end.

At least 7 moves

6 algorithms

First algorithm: (U) R U R' U R U2' R'

At least 7 moves

7 algorithms

First algorithm: (U2) R' U' R U' R' U2 R

At least 7 moves

9 algorithms

First algorithm: R U R' U2 R U2 R'

At least 7 moves

6 algorithms

First algorithm: R U2 R' U' R U' R'

At least 7 moves

5 algorithms

First algorithm: (U2') Uv2' R2' DR' R U2 R' DR R U2' R Uv2

At least 7 moves

13 algorithms

First algorithm: (U2) R BR BL' BR' R' BR BL BR'

At least 7 moves

10 algorithms

First algorithm: (U2) R' F R BR' R' F' R BR

At least 7 moves

11 algorithms

First algorithm: R U2 R' U R U2 R'