Cubemuch Français

Guimond orientation

Three bottom-layer corners show either U or D on the bottom; DFR does not. Orient the remaining corners before separating the colours. Orient the corners while treating U and D as one colour.

16 cases · 141 algorithms

Proven optimum for every case.

Definition of the set: Speedsolving wiki (Guimond Method), Speedsolving wiki (VOP 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 4 moves

8 algorithms

First algorithm: y' R' y R2 U R

Case 2

Optimum 4 moves

9 algorithms

First algorithm: (U) R y' R2 U' R

Case 3

Optimum 6 moves

10 algorithms

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

Case 4

Optimum 6 moves

10 algorithms

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

Case 5

Optimum 4 moves

8 algorithms

First algorithm: (U') x U2 R2 y R' U

Case 6

Optimum 4 moves

7 algorithms

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

Case 7

Optimum 3 moves

10 algorithms

First algorithm: (U') R' U2 R

Case 8

Optimum 3 moves

7 algorithms

First algorithm: (U) R U2 R

Case 9

Optimum 3 moves

8 algorithms

First algorithm: (U) x U2 B' U

Case 10

Optimum 3 moves

8 algorithms

First algorithm: (U') R2 U R

Case 11

Optimum 3 moves

8 algorithms

First algorithm: y L' U L

Case 12

Optimum 3 moves

8 algorithms

First algorithm: R U' R

Case 13

Optimum 3 moves

10 algorithms

First algorithm: (U) R' U' R

Case 14

Optimum 3 moves

9 algorithms

First algorithm: (U) R U R

Case 15

Optimum 4 moves

11 algorithms

First algorithm: (U) y2 B L B' L

Case 16

Optimum 4 moves

10 algorithms

First algorithm: y2 L' B' L B

Algorithms