Euclidean tours in fairy chess
The present paper aims to generalize the Knight's tour problem for $k$-dimensional grids of the form $\{0,1\}^k$ by considering other fairy chess leapers. Accordingly, we constructively show the existence of closed tours in $2 \times 2 \times \cdots \times 2$ ($k$ times) chessboards concerning the Wazir, the Threeleaper, and the Zebra, for all $k \geq 15$. This extends the recent discovery of Euclidean Knight's tours on these grids to the above-mentioned leapers, opening a new research direction on fairy chess leapers performing fixed-length jumps on regular grids.
Authors
- Marco Ripà (ORCID: https://orcid.org/0000-0002-6036-5541)
- Gabriele Di Pietro (ORCID: https://orcid.org/0009-0000-9276-1269)
Publication Details
- Journal
- Notes on Number Theory and Discrete Mathematics
- Published
- 2025-04-01
- DOI
- https://doi.org/10.7546/nntdm.2025.31.1.54-68
- Primary Topic
- Artificial Intelligence in Games
- Type
- article
- Field-Weighted Citation Impact
- 0.00