A Proof of Willcocks's Conjecture
Combinatorics
2018-03-06 v2
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.
Keywords
Cite
@article{arxiv.1708.05810,
title = {A Proof of Willcocks's Conjecture},
author = {Nikolai Beluhov},
journal= {arXiv preprint arXiv:1708.05810},
year = {2018}
}
Comments
25 pages, 23 figures