Cubemuch Français

Opposite layer

The D centre and four D corners are solved. Solve the U corners and U centre, as in Sarah intermediate and the Yutong Liang last-layer step. Solve the opposite layer, leaving side centres free.

11 cases · 1,023 algorithms

Proven optimum for every case.

Definition of the set: Yutong Liang, Sarah Strong's site.

How to read this page
  • Each case is drawn on a flat net of the puzzle’s faces. Grey marks the stickers that the case does not constrain.
  • 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.

LL 01 · Singlet

Optimum 4 moves

79 algorithms

First algorithm: U' L B R'

LL 10 · Triplet

Optimum 8 moves

120 algorithms

First algorithm: U L R' U R' L' R' B

LL 02 · Singlet

Optimum 4 moves

90 algorithms

First algorithm: R U' R' B

LL 09 · Triplet

Optimum 7 moves

114 algorithms

First algorithm: L R' L B L' R U

LL 04 · Doublet

Optimum 7 moves

83 algorithms

First algorithm: L B U R L' U' R

LL 06 · Doublet

Optimum 8 moves

92 algorithms

First algorithm: L U B' L U' B' L U'

LL 07 · Doublet

Optimum 8 moves

91 algorithms

First algorithm: U R' B' L U B' R' L

LL 05 · Doublet

Optimum 7 moves

72 algorithms

First algorithm: U' R' B' L U B' R'

LL 08 · Doublet

Optimum 8 moves

93 algorithms

First algorithm: R U R' U' B' R' B U

LL 03 · Doublet

Optimum 8 moves

97 algorithms

First algorithm: U L R L R' L B L

LL 11 · Triplet

Optimum 8 moves

92 algorithms

First algorithm: U L' R' U' R L U' B

Algorithms