EG-1

The bottom face shows its colour but two of its adjacent corners are swapped; one algorithm solves the whole cube. 40 cases.

40 cases · 932 algorithms

Proven optimum for every case.

Definition of the set: Speedsolving wiki (EG Method).

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

EG1 H 2

Optimum 9 moves

23 algorithms

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

EG1 Pi 3

Optimum 8 moves

20 algorithms

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

EG1 H 1

Optimum 8 moves

24 algorithms

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

EG1 H 3

Optimum 8 moves

20 algorithms

First algorithm: x U' L' U' L2 y' L U' L U'

EG1 Pi 1

Optimum 8 moves

26 algorithms

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

EG1 Pi 2

Optimum 7 moves

25 algorithms

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

EG1 H 4

Optimum 8 moves

22 algorithms

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

EG1 U 1

Optimum 7 moves

25 algorithms

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

EG1 T 5

Optimum 9 moves

23 algorithms

First algorithm: L' y U L' U L2 U L y' U' L

EG1 U 3

Optimum 7 moves

24 algorithms

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

EG1 T 4

Optimum 8 moves

25 algorithms

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

EG1 Pi 4

Optimum 8 moves

23 algorithms

First algorithm: L' U x L' U' L U' L2 U'

EG1 AS 4

Optimum 9 moves

21 algorithms

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

EG1 S 5

Optimum 8 moves

22 algorithms

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

EG1 AS 3

Optimum 8 moves

19 algorithms

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

EG1 S 6

Optimum 8 moves

17 algorithms

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

EG1 S 4

Optimum 9 moves

20 algorithms

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

EG1 AS 5

Optimum 8 moves

25 algorithms

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

EG1 S 3

Optimum 8 moves

19 algorithms

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

EG1 AS 6

Optimum 8 moves

17 algorithms

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

EG1 T 6

Optimum 9 moves

25 algorithms

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

EG1 U 2

Optimum 8 moves

26 algorithms

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

EG1 U 4

Optimum 9 moves

20 algorithms

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

EG1 T 3

Optimum 8 moves

23 algorithms

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

EG1 Pi 6

Optimum 9 moves

26 algorithms

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

EG1 Pi 5

Optimum 9 moves

27 algorithms

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

EG1 S 2

Optimum 8 moves

26 algorithms

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

EG1 AS 2

Optimum 8 moves

22 algorithms

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

EG1 U 5

Optimum 8 moves

24 algorithms

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

EG1 U 6

Optimum 8 moves

28 algorithms

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

EG1 S 1

Optimum 6 moves

24 algorithms

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

EG1 AS 1

Optimum 6 moves

24 algorithms

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

EG1 T 2

Optimum 8 moves

24 algorithms

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

EG1 T 1

Optimum 8 moves

26 algorithms

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

EG1 L 6

Optimum 8 moves

30 algorithms

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

EG1 L 5

Optimum 8 moves

25 algorithms

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

EG1 L 1

Optimum 8 moves

23 algorithms

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

EG1 L 2

Optimum 8 moves

28 algorithms

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

EG1 L 3

Optimum 9 moves

19 algorithms

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

EG1 L 4

Optimum 9 moves

22 algorithms

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