On the existence of Hamiltonian cycles in hypercubes

Gabriele Di Pietro, Marco Ripà

Published 2024-09-04Version 1

For each pair of positive integers $(a,b)$ such that $a \geq 0$ and $b > 1$, the present paper provides a necessary and sufficient condition for the existence of Hamiltonian cycles visiting all the vertices of any $k$-dimensional grid $\{0,1\}^k \subset \mathbb{R}^k$ and whose associated Euclidean distance is equal to $\sqrt{a^2+b^2}$. Our solution extends previously stated results in fairy chess on the existence of closed Euclidean $(a,b)$-leapers tours for $2 \times 2 \times \cdots \times 2$ chessboards, where the (Euclidean) knight identifies the $(1,2)$-leaper.