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