Taming the Knight's Tour: Minimizing Turns and Crossings

Juan Jose Besa, Timothy Johnson, Nil Mamano +2

We introduce two new metrics of "simplicity" for knight's tours: the number of turns and the number of crossings. We give a novel algorithm that produces tours with $9.25n+O(1)$ tu…