3x3x3 Fewest Moves: algorithm sets

Finishing cycles (7)

Algorithms that change very few pieces, for finishing a solution.

Each effect is simulated in tests/learn-content.test.ts.

R U' R U R U R U' R' U' R2 — Ua: cycle three edges

R2 U R U R' U' R' U' R' U R' — Ub: cycle three edges the other way

M2 U M U2 M' U M2 — M-slice edge 3-cycle

R' F R' B2 R F' R' B2 R2 — A-perm: cycle three corners

R U R' F' R U R' U' R' F R2 U' R' U' — Jb: swap two edges and two corners (parity)

R U R' U' R' F R2 U' R' U' R U R' F' — T-perm: swap two edges and two corners

F R U' R' U' R U R' F' R U R' U' R' F R F' — Y-perm: swap two diagonal corners (and two edges)