Case 1
Optimum 6 moves
11 algorithms
First algorithm: (U2) R U R' y' R2 U2 R
D-colour corners at DBL, DBR and DFL are oriented, in any order. Orient the remaining corners without separating the U and D colours. Orient the corners from the HD three-corner V.
23 cases · 214 algorithms
Proven optimum for every case.
124 writings are played from a representative position of the case. They reach the goal shown in the dialog without necessarily solving the whole puzzle.
Definition of the set: Speedsolving wiki (HD Method), public sheet.
Optimum 6 moves
11 algorithms
First algorithm: (U2) R U R' y' R2 U2 R
Optimum 3 moves
11 algorithms
First algorithm: (U) R2 U2 R
Optimum 4 moves
8 algorithms
First algorithm: y' R' y R2 U R
Optimum 4 moves
8 algorithms
First algorithm: (U) R y' R2 U' R
Optimum 6 moves
10 algorithms
First algorithm: y' R U' R' y R U2 R
Optimum 6 moves
11 algorithms
First algorithm: R' U R y' R' U2 R
Optimum 4 moves
8 algorithms
First algorithm: (U') x U2 R2 y R' U
Optimum 5 moves
10 algorithms
First algorithm: (U) R2 U R' U R
Optimum 4 moves
8 algorithms
First algorithm: (U) x R2 U2 x' U R
Optimum 3 moves
8 algorithms
First algorithm: (U') y L' U2 L
Optimum 5 moves
11 algorithms
First algorithm: (U2) R2 U' R U' R
Optimum 3 moves
7 algorithms
First algorithm: (U) R U2 R
Optimum 3 moves
8 algorithms
First algorithm: (U) x U2 B' U
Optimum 3 moves
8 algorithms
First algorithm: (U') R2 U R
Optimum 5 moves
10 algorithms
First algorithm: R' U2 R' U2 R
Optimum 3 moves
8 algorithms
First algorithm: y L' U L
Optimum 6 moves
10 algorithms
First algorithm: R U' R' y' R' U R
Optimum 3 moves
7 algorithms
First algorithm: R U' R
Optimum 5 moves
11 algorithms
First algorithm: x U2 R' U' R U
Optimum 3 moves
10 algorithms
First algorithm: (U) y L' U' L
Optimum 3 moves
9 algorithms
First algorithm: (U) R U R
Optimum 4 moves
11 algorithms
First algorithm: (U) y2 B L B' L
Optimum 4 moves
11 algorithms
First algorithm: y2 L' B' L B
No case matches these filters.