Research Paper DigestsHow Many Moves Does It Take to Reshuffle Two Tokens? A Tight Linear Bound
A new proof shows that repositioning two non-attacking tokens on a graph, one step at a time, never needs more than four moves per vertex — resolving a question left open since 2021.