An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle

Matteo Caporrella, Stefano Leucci

We study the Torus Puzzle, a solitaire game in which the elements of an input $m\times n$ matrix need to be rearranged into a target configuration via a sequence of unit rotations…