GO
Algorithms (3)
U D 2R U' 2R' D2 2R U 2R' D U'
My choice
15 HTM · 11 STM · 16 QTM
3-gen
rotationless
<U,R,D>
One hand: R, U and M with F or D
BLDDB, on 16 solvers' sheets
U' D2 R' 2U' R D2 R' 2U R U
12 HTM · 10 STM · 14 QTM
3-gen
rotationless
<U,R,D>
One hand: R, U and M with F or D
BLDDB, on 3 solvers' sheets
Rw D U R U' 2R2 U R' U' 2R2 D' Rw'
14 HTM · 12 STM · 18 QTM
3-gen
rotationless
<U,R,D>
One hand: R, U and M with F or D
BLDDB, on 2 solvers' sheets
How this case is verified
The case is the source's setup (or, where it has none, another source algorithm reversed). Setup: U' R' 2U' R D2 R' 2U R D2 U. Every algorithm above was run by our logic engine from that state and reaches "solved".