{"paper":{"title":"Generalised Knight's Tours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nina Kam\\v{c}ev","submitted_at":"2013-11-17T02:18:17Z","abstract_excerpt":"The problem of existence of closed knight's tours in $[n]^d$, where $[n]=\\{0, 1, \\dots, n-1\\}$, was recently solved by Erde, Gol\\'{e}nia, and Gol\\'{e}nia. They raised the same question for a generalised, $(a, b)$ knight, which is allowed to move along any two axes of $[n]^d$ by $a$ and $b$ unit lengths respectively. Given an even number $a$, we show that the $[n]^d$ grid admits an $(a, 1)$ knight's tour for sufficiently large even side length $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4109","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}