CT
Algorithms (3)
U2 2L 2D2 2L' U' 2L 2D2 2L' U'
My choice
15 HTM · 9 STM · 20 QTM
3-gen
rotationless
<U,D,L>
One hand: needs L, B, S or E
BLDDB, on 9 solvers' sheets
4Dw 2R 2D' 2R' U' 2R 2D 2R' y
14 HTM · 8 STM · 14 QTM
3-gen
rotation
<U,R,D>
One hand: R, U and M with F or D
BLDDB, on 3 solvers' sheets
U' 2L U' 2L' U 2R' U' 2L U 2R 2L' U
18 HTM · 12 STM · 18 QTM
3-gen
rotationless
<U,R,L>
One hand: needs L, B, S or E
BLDDB, on 2 solvers' sheets
How this case is verified
The case is the source's setup (or, where it has none, another source algorithm reversed). Setup: y' 2R 2D' 2R' U 2R 2D 2R' 4Dw'. Every algorithm above was run by our logic engine from that state and reaches "solved".