UX
Algorithms (3)
4Rw U' L 2U' L' U2 L 2U L' U' 4Rw'
My choice
13 HTM · 11 STM · 14 QTM
3-gen
rotationless
<U,R,L>
One hand: needs L, B, S or E
BLDDB, on 6 solvers' sheets
Rw 2L' U2 2L D 2L' U2 2L D' Rw'
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
How this case is verified
The case is the source's setup (or, where it has none, another source algorithm reversed). Setup: Rw D 2L' U2 2L D' 2L' U2 2L Rw'. Every algorithm above was run by our logic engine from that state and reaches "solved".