GR
Algorithms (3)
y' F' 2R U 2R' 3D 2R U' 2R' 3D' F y
My choice
16 HTM · 10 STM · 16 QTM
rotation
<U,R,F,D>
One hand: R, U and M with F and D
BLDDB, on 1 solver's sheet
U 4Rw' 3L' U' 3L 2D 3L' U 3L 2D' 4Rw U'
18 HTM · 12 STM · 18 QTM
rotationless
<U,R,D,L>
One hand: needs L, B, S or E
BLDDB, on 1 solver's sheet
L' 3D' 2L U2 2L' 3D 2L U2 2L' L
16 HTM · 10 STM · 18 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: U 4Rw' 2D 3L' U' 3L 2D' 3L' U 3L 4Rw U'. Every algorithm above was run by our logic engine from that state and reaches "solved".