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