Complexity Thresholds for the Constrained Colored Token Swapping Problem

Consider the following puzzle: a farmland consists of several fields, each occupied by either a farmer, a fox, a chicken, or a caterpillar. Creatures in neighboring fields can swap positions as long as the fox avoids the farmer, the chicken avoids the fox, and the caterpillar avoids the chicken. The objective is to decide whether there exists a sequence of swaps that rearranges the creatures into a desired final configuration, while avoiding any unwanted encounters. The above puzzle can be cast an instance of the colored token swapping problem with k = 4 colors (i.e., creature types), in which only certain pairs of colors can be swapped. We prove that such problem is 𝖯𝖲𝖯𝖠𝖢𝖤-hard even when the graph representing the farmland is planar and cubic. We also show that the problem is polynomial-time solvable when at most three creature types are involved. We do so by providing a more general algorithm deciding instances with arbitrary values of k, as long as the set of all admissible swaps between creature types induces a spanning star. Our results settle a problem explicitly left open in [Yang and Zhang, IPL 2025], which established 𝖯𝖲𝖯𝖠𝖢𝖤-completeness for eight creature types and left the complexity status unresolved when the number of creature types is between three and seven.