A Proof of Willcocks's Conjecture
Nikolai Beluhov

TL;DR
This paper proves Willcocks's Conjecture, demonstrating that under certain coprimality conditions, a Hamiltonian tour exists for a specific chess piece on a square board, resolving an open problem from 1976.
Contribution
The paper provides a formal proof of Willcocks's Conjecture, establishing the existence of Hamiltonian tours for (p, q)-leapers under the specified conditions.
Findings
Proof of Willcocks's Conjecture completed
Existence of Hamiltonian tours for (p, q)-leapers proven
Conjecture resolved after 47 years
Abstract
We give a proof of Willcocks's Conjecture, stating that if and are relatively prime, then there exists a Hamiltonian tour of a -leaper on a square chessboard of side . The conjecture was formulated by T. H. Willcocks in 1976 and has been an open problem since.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Limits and Structures in Graph Theory · History and Theory of Mathematics
