New constructions solve the Crazy Knight's Tour Problem for cyclically k-diagonal arrays with odd n and k, supporting a conjecture that this is necessary and sufficient.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A conjecture on the Crazy Knight's Tour Problem
New constructions solve the Crazy Knight's Tour Problem for cyclically k-diagonal arrays with odd n and k, supporting a conjecture that this is necessary and sufficient.