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
2F' 4Rw L 2U L' U' L 2U' L' U 4Rw' 2F
16 HTM · 12 STM · 16 QTM
rotationless
<U,R,F,L>
One hand: needs L, B, S or E
BLDDB, on 1 solver's sheet
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
How this case is verified
The case is the source's setup (or, where it has none, another source algorithm reversed). Setup: 2F' 4Rw U' L 2U L' U L 2U' L' 4Rw' 2F. Every algorithm above was run by our logic engine from that state and reaches "solved".