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

Marco Ripà

The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set…