GO
Algorithms (3)
U D 3L' U' 3L D2 3L' U 3L D U'
My choice
15 HTM · 11 STM · 16 QTM
3-gen
rotationless
<U,D,L>
One hand: needs L, B, S or E
BLDDB, on 8 solvers' sheets
3L' D 3L' D2 3L D 3L
11 HTM · 7 STM · 12 QTM
2-gen
rotationless
<D,L>
One hand: needs L, B, S or E
BLDDB, on 4 solvers' sheets
y D2 3L' U' 3L D2 3L' U 3L y'
12 HTM · 8 STM · 14 QTM
3-gen
rotation
<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: 3L' D' 3L' D2 3L D' 3L. Every algorithm above was run by our logic engine from that state and reaches "solved".