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