Consecutive 3-Cycle Moves

Sorting A = 0k1n−k to A* = 1n−k0k via generators of the CC3 Schreier graph

Parameters
3 ≤ n ≤ 14
1 ≤ k ≤ n−1
Generators
Start to see moves
Transformation
Current Move
Press START to compute the shortest path and begin.