Cubemuch Français

COLL

When the last-layer edges are oriented, one algorithm orients and places its corners without breaking F2L; only an EPLL is left. 42 cases, sorted by corner shape.

42 cases · 9,720 algorithms

Proven optimum for every case.

Definition of the set: Speedsolving wiki (COLL).

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: yellow on top, blue in front, red on the right. Grey marks what the case does not look at.
  • Lengths in HTM: a face turn or a wide turn counts 1, a slice 2, a rotation 0. The "setup" (often a U turn) presents the cube 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.

COLL 1

T 1

Optimum 12 moves

248 algorithms

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

COLL 1

U 1

Optimum 12 moves

265 algorithms

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

Case 3

Optimum 9 moves

116 algorithms

First algorithm: (U2) x Lw' B Lw' U2 Lw B' Lw' U2 Lw2

COLL 1

L 1

Optimum 11 moves

233 algorithms

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

COLL 1

AS 1

Optimum 7 moves

189 algorithms

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

COLL 1

S 1

Optimum 7 moves

162 algorithms

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

COLL 1

Pi 1

Optimum 9 moves

216 algorithms

First algorithm: L' U2 L2 U L2 U L2 U2 L'

COLL 1

H 1

Optimum 11 moves

142 algorithms

First algorithm: L U L' U L U' L' U L U2 L'

COLL 2

T 2

Optimum 10 moves

283 algorithms

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

COLL 2

U 2

Optimum 13 moves

353 algorithms

First algorithm: R U' R' U F' Rw U' L' U2 R' U R U'

COLL 2

L 2

Optimum 9 moves

211 algorithms

First algorithm: (U2) B' U2 B' D' B U2 B' D B2

COLL 2

S 2

Optimum 10 moves

203 algorithms

First algorithm: (U) L' U2 L U2 R U' Rw' F M'

COLL 2

AS 2

Optimum 10 moves

243 algorithms

First algorithm: (U2) L' B U2 B' L B L' U2 L B'

COLL 2

H 2

Optimum 11 moves

290 algorithms

First algorithm: (U') L' U2 M' x' D R2 U R2 Uw' R2 B

COLL 2

Pi 2

Optimum 12 moves

248 algorithms

First algorithm: (U) Lw' B2 Lw U2 Lw U' Lw B Lw U' Lw B

COLL 3

L 3

Optimum 9 moves

227 algorithms

First algorithm: (U') B U2 B D B' U2 B D' B2

COLL 3

T 3

Optimum 8 moves

265 algorithms

First algorithm: (U) B' Lw' U Lw B Lw' U' Lw

COLL 3

U 3

Optimum 9 moves

257 algorithms

First algorithm: (U2) B2 D B' U2 B D' B' U2 B'

COLL 3

S 3

Optimum 10 moves

243 algorithms

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

COLL 3

AS 3

Optimum 10 moves

243 algorithms

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

COLL 3

Pi 3

Optimum 11 moves

258 algorithms

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

COLL 3

H 3

Optimum 11 moves

265 algorithms

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

COLL 4

AS 4

Optimum 10 moves

221 algorithms

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

COLL 4

L 4

Optimum 8 moves

189 algorithms

First algorithm: (U) B' Lw' U' Lw B Lw' U Lw

COLL 4

T 4

Optimum 9 moves

249 algorithms

First algorithm: Lw U2 Lw B2 Lw' U2 Lw B2 Lw2

COLL 4

U 4

Optimum 9 moves

213 algorithms

First algorithm: (U) Lw2 B2 Lw' U2 Lw B2 Lw' U2 Lw'

COLL 4

S 4

Optimum 10 moves

246 algorithms

First algorithm: (U2) B L' U2 L B' L' B U2 B' L

COLL 4

Pi 4

Optimum 12 moves

267 algorithms

First algorithm: (U2) L U2 L' B L' B R B R' B2 L B'

COLL 4

H 4

Optimum 11 moves

201 algorithms

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

COLL 5

L 5

Optimum 8 moves

217 algorithms

First algorithm: (U2) B Rw U Rw' B' Rw U' Rw'

COLL 5

T 5

Optimum 8 moves

280 algorithms

First algorithm: B Rw U' Rw' B' Rw U Rw'

COLL 5

U 5

Optimum 9 moves

230 algorithms

First algorithm: (U2) x Rw2 B' Rw U2 Rw' B Rw U2 Rw

COLL 5

AS 5

Optimum 7 moves

212 algorithms

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

Case 34

Optimum 13 moves

85 algorithms

First algorithm: x' U2 B' Lw2 U Lw' B' Lw' B U Lw' U' Lw U

COLL 5

S 5

Optimum 7 moves

232 algorithms

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

COLL 5

Pi 5

Optimum 11 moves

230 algorithms

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

COLL 6

T 6

Optimum 11 moves

241 algorithms

First algorithm: L U' L2 D' Lw U2 Lw' D L2 U L'

COLL 6

U 6

Optimum 10 moves

258 algorithms

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

COLL 6

L 6

Optimum 9 moves

257 algorithms

First algorithm: B Rw2 B' U B' U' B2 Rw2 B'

COLL 6

AS 6

Optimum 11 moves

231 algorithms

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

COLL 6

S 6

Optimum 11 moves

221 algorithms

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

COLL 6

Pi 6

Optimum 12 moves

280 algorithms

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

Algorithms