An exploration of pairwise adjacent swaps on elements of permutation groups for different topologies.
- Word problem (Wikipedia) - Related to the problem of simplifying the words we generate, as well as the problem of finding the fundamental rules.
- Reachability problem (Wikipedia) - Are all permutations reachable using these actions? Probably. Do all paths lead to a complete reversal of the initial arrangement (without backtracking)? No, as seen in the 2x2 case.