On the number of open knight's tours

Abstract

We review the state of the art in the problem of counting the number open knight tours, since the publication in internet of a computation of this quantity.

3 pages

References in corpus (1)

• Counting Knight's Tours through the Randomized Warnsdorff Rule

Cited by in corpus (1)

• Proving the existence of Euclidean knight's tours on $n\times n\times \cdots \times n$ chessboards for $n<4$