GF
Algorithms (3)
D 2R' D' L D 2R D' L'
My choice
10 HTM · 8 STM · 10 QTM
3-gen
rotationless
<R,D,L>
One hand: needs L, B, S or E
BLDDB, on 25 solvers' sheets
S U' R' 2U' R U' R' 2U R U2 S'
15 HTM · 11 STM · 16 QTM
3-gen
rotationless
<U,R,S>
One hand: needs L, B, S or E
BLDDB, on 1 solver's sheet
L' F' U' 2L' U L' U' 2L U L F L
14 HTM · 12 STM · 14 QTM
3-gen
rotationless
<U,F,L>
One hand: needs L, B, S or E
BLDDB, on 1 solver's sheet
How this case is verified
The case is the source's setup (or, where it has none, another source algorithm reversed). Setup: S U2 R' 2U' R U R' 2U R U S'. Every algorithm above was run by our logic engine from that state and reaches "solved".