We consider a puzzle consisting of colored tokens on an n-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to "sequentially" move the chosen token along a path of the graph by swapping it with other tokens on the path.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
- Geometry and Topology
- Computer Science Applications
- Computational Theory and Mathematics