GT
Algorithms (3)
D U' R' U 2R U' R U 2R' D'
My choice
12 HTM · 10 STM · 12 QTM
3-gen
rotationless
<U,R,D>
One hand: R, U and M with F or D
BLDDB, on 27 solvers' sheets
R' U 2R' D 2R U' 2R' D' Rw
12 HTM · 9 STM · 12 QTM
3-gen
rotationless
<U,R,D>
One hand: R, U and M with F or D
BLDDB, on 2 solvers' sheets
4Lw' D 2R' U' L' U 2R U' L U D' 4Lw
14 HTM · 12 STM · 14 QTM
rotationless
<U,R,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: Rw' D 2R U 2R' D' 2R U' R. Every algorithm above was run by our logic engine from that state and reaches "solved".