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