The knight's tour problem is a popular puzzle. The goal is to find a cycle going through every cell in a rectangular board using only knight moves. We propose a new method with a special property: compared to previous methods, it has a small number of turns and crossings. A turn is a triplet of consecutive squares in the tour with non-collinear coordinates. A crossing occurs when the two line segments corresponding to moves in the tour intersect. For details about the algorithm, see the preprint available online.
Developed by UCI grad students Juan Jose Besa Vidal, Timothy Johnson, Nil Mamano, and Martha Osegueda. Requires HTML5. Works (at least) on latest Chrome for desktop. Maintained by/Contact: Nil Mamano.