UX
Algorithms (3)
Rw 2L' U2 2L D 2L' U2 2L D' Rw'
My choice
14 HTM · 10 STM · 16 QTM
rotationless
<U,R,D,L>
One hand: needs L, B, S or E
BLDDB, on 6 solvers' sheets
Lw U L U 2L U' L' U 2L' U2 Lw'
13 HTM · 11 STM · 14 QTM
2-gen
rotationless
<U,L>
One hand: needs L, B, S or E
BLDDB, on 5 solvers' sheets
U L2 U 2L2 U' L2 U 2L2 U2
11 HTM · 9 STM · 18 QTM
2-gen
rotationless
<U,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: Lw U2 2L U' L U 2L' U' L' U' Lw'. Every algorithm above was run by our logic engine from that state and reaches "solved".