Autumn Variation

The CLS cases whose pair corner is in the top layer, its bottom colour facing up. 27 cases.

27 cases · 326 algorithms

Proven optimum for every case.

Definition of the set: Speedsolving wiki (CLS).

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: 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.

AVLS UFR00

CLS UFR00, ELS E0

Optimum 7 moves

14 algorithms

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

AVLS UFR03

CLS UFR03, ELS E0

Optimum 8 moves

14 algorithms

First algorithm: (U') F' R B' R' F R B R'

AVLS UFR06

CLS UFR06, ELS E0

Optimum 8 moves

17 algorithms

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

AVLS UFR09

CLS UFR09, ELS E0

Optimum 9 moves

9 algorithms

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

AVLS UFR18

CLS UFR18, ELS E0

Optimum 7 moves

12 algorithms

First algorithm: B U' F2 U B' U' F2

AVLS UFR01

CLS UFR01, ELS E0

Optimum 7 moves

11 algorithms

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

AVLS UFR02

CLS UFR02, ELS E0

Optimum 9 moves

12 algorithms

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

AVLS UFR12

CLS UFR12, ELS E0

Optimum 9 moves

12 algorithms

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

AVLS UFR21

CLS UFR21, ELS E0

Optimum 10 moves

13 algorithms

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

AVLS UFR15

CLS UFR15, ELS E0

Optimum 9 moves

10 algorithms

First algorithm: (U2) F' L2 U2 F' L2 F U2 L2 F

AVLS UFR24

CLS UFR24, ELS E0

Optimum 10 moves

15 algorithms

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

AVLS UFR04

CLS UFR04, ELS E0

Optimum 10 moves

11 algorithms

First algorithm: Rw U2 B U2 B2 U2 B U2 B Rw'

AVLS UFR05

CLS UFR05, ELS E0

Optimum 9 moves

9 algorithms

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

AVLS UFR07

CLS UFR07, ELS E0

Optimum 10 moves

9 algorithms

First algorithm: (U2) F U' R2 U R2 U F' R2 U2 R2

AVLS UFR08

CLS UFR08, ELS E0

Optimum 9 moves

7 algorithms

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

AVLS UFR10

CLS UFR10, ELS E0

Optimum 9 moves

11 algorithms

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

AVLS UFR19

CLS UFR19, ELS E0

Optimum 10 moves

11 algorithms

First algorithm: (U) x U2 B2 U2 R' B U2 B U2 B' R

AVLS UFR11

CLS UFR11, ELS E0

Optimum 10 moves

16 algorithms

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

AVLS UFR20

CLS UFR20, ELS E0

Optimum 9 moves

17 algorithms

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

AVLS UFR13

CLS UFR13, ELS E0

Optimum 11 moves

12 algorithms

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

AVLS UFR22

CLS UFR22, ELS E0

Optimum 10 moves

8 algorithms

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

AVLS UFR16

CLS UFR16, ELS E0

Optimum 10 moves

11 algorithms

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

AVLS UFR25

CLS UFR25, ELS E0

Optimum 10 moves

12 algorithms

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

AVLS UFR14

CLS UFR14, ELS E0

Optimum 10 moves

13 algorithms

First algorithm: (U') R2 U B U' B' R2 U F' U2 F

AVLS UFR23

CLS UFR23, ELS E0

Optimum 10 moves

9 algorithms

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

AVLS UFR17

CLS UFR17, ELS E0

Optimum 10 moves

14 algorithms

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

AVLS UFR26

CLS UFR26, ELS E0

Optimum 11 moves

17 algorithms

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