Cubemuch Français

TEG-1 D-

The bottom layer has an adjacent corner swap, with its bar at the front. Its DFR corner is twisted so that the D sticker faces R. The top layer is free; bottom-layer positions are considered up to a D turn. Solve a twisted EG layer with the DFR sticker facing R.

43 cases · 389 algorithms

Proven optimum for every case.

Definition of the set: public sheet.

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 8 moves

6 algorithms

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

Case 2

Optimum 7 moves

8 algorithms

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

Case 3

Optimum 6 moves

7 algorithms

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

Case 4

Optimum 7 moves

7 algorithms

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

Case 5

Optimum 7 moves

9 algorithms

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

Case 6

Optimum 7 moves

7 algorithms

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

Case 7

Optimum 8 moves

9 algorithms

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

Case 8

Optimum 7 moves

7 algorithms

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

Case 9

Optimum 7 moves

8 algorithms

First algorithm: L2 U L U2 L2 y U L

Case 10

Optimum 8 moves

10 algorithms

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

Case 11

Optimum 8 moves

9 algorithms

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

Case 12

Optimum 9 moves

12 algorithms

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

Case 13

Optimum 8 moves

11 algorithms

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

Case 14

Optimum 8 moves

9 algorithms

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

Case 15

Optimum 8 moves

11 algorithms

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

Case 16

Optimum 7 moves

8 algorithms

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

Case 17

Optimum 7 moves

7 algorithms

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

Case 18

Optimum 8 moves

9 algorithms

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

Case 19

Optimum 8 moves

10 algorithms

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

Case 20

Optimum 8 moves

10 algorithms

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

Case 21

Optimum 8 moves

11 algorithms

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

Case 22

Optimum 7 moves

7 algorithms

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

Case 23

Optimum 8 moves

10 algorithms

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

Case 24

Optimum 9 moves

11 algorithms

First algorithm: y L U' L B' L U' B2 L B'

Case 25

Optimum 8 moves

11 algorithms

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

Case 26

Optimum 8 moves

8 algorithms

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

Case 27

Optimum 8 moves

10 algorithms

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

Case 28

Optimum 8 moves

7 algorithms

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

Case 29

Optimum 7 moves

9 algorithms

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

Case 30

Optimum 9 moves

11 algorithms

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

Case 31

Optimum 7 moves

9 algorithms

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

Case 32

Optimum 7 moves

8 algorithms

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

Case 33

Optimum 8 moves

11 algorithms

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

Case 34

Optimum 8 moves

8 algorithms

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

Case 35

Optimum 6 moves

9 algorithms

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

Case 36

Optimum 7 moves

8 algorithms

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

Case 37

Optimum 8 moves

11 algorithms

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

Case 38

Optimum 8 moves

12 algorithms

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

Case 39

Optimum 8 moves

10 algorithms

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

Case 40

Optimum 8 moves

8 algorithms

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

Case 41

Optimum 6 moves

8 algorithms

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

Case 42

Optimum 8 moves

10 algorithms

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

Case 43

Optimum 8 moves

8 algorithms

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

Algorithms