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