Pi
Optimum 7 moves
84 algorithms
First algorithm: R' U R2 y' R' U2 x' U R
The D face is one colour, with its corners in any order. Orient U while keeping D oriented. Orient the top face after making the bottom face.
7 cases · 575 algorithms
Proven optimum for every case.
Definition of the set: Speedsolving wiki (Ortega Method).
Optimum 7 moves
84 algorithms
First algorithm: R' U R2 y' R' U2 x' U R
Optimum 5 moves
59 algorithms
First algorithm: R2 U2 R U2 R2
Optimum 6 moves
77 algorithms
First algorithm: R U' x U2 R2 y R' U
Optimum 6 moves
58 algorithms
First algorithm: (U) R' y' R U2 x' U2 R U'
Optimum 6 moves
107 algorithms
First algorithm: (U2) R U x U R' U' R'
Optimum 7 moves
98 algorithms
First algorithm: (U2) R U R' y' U' R' U' R
Optimum 7 moves
92 algorithms
First algorithm: (U') R U' R' y' U' R' U R
No case matches these filters.