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