Unmixing

All corners are oriented, but U and D colours are mixed between the layers. Make each face one colour; the two faces may be exchanged. Separate the U and D colours after orientation.

6 cases · 52 algorithms

Proven optimum for every case.

Definition of the set: Speedsolving wiki (GBC), Speedsolving wiki (Guimond Method).

How to read this page

Each case is seen at three quarters: top, front and right faces, plus the top layer's back and left stickers as flat strips.
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.

Case 1

Optimum 3 moves

7 algorithms

First algorithm: x' U2 B' U2

Case 2

Optimum 1 move

6 algorithms

First algorithm: R2

Case 3

Optimum 5 moves

10 algorithms

First algorithm: x' U2 B U2 B U2

Case 4

Optimum 5 moves

11 algorithms

First algorithm: (D) R2 U' R2 U' R2

Case 5

Optimum 3 moves

10 algorithms

First algorithm: x2 R2 U2 x U2

L-shape

Optimum 3 moves

8 algorithms

First algorithm: (U2) R2 U R2