Constrained Colored Token Swapping

This webpage showcases a reduction from the configuration-to-configuration Nondeterministic Constraint Logic (NCL) problem to the Colored Token Swapping problem with additional constraints on which pairs of colors can be swapped. The reduction is described in this paper.

Click on two vertices that are adjacent in the graph on the left, and whose colors are adjacent in the swap graph (shown at the bottom) to swap their colors. Each arrangement of colors corresponds to an orientation of the edges in a NCL graph, shown on the top right. The goal is matching the orientation of the edges shown in the NCL configuration on the bottom right.