The closed knight tour problem in higher dimensions
classification
🧮 math.CO
keywords
rectangularboardscloseddimensionalknightproblemarticlechessboards
read the original abstract
The problem of existence of closed knight tours for rectangular chessboards was solved by Schwenk in 1991. Last year, in 2011, DeMaio and Mathew provide an extension of this result for 3-dimensional rectangular boards. In this article, we give the solution for $n$-dimensional rectangular boards, for $n\geq 4$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.