高维闭骑士巡回问题
The closed knight tour problem in higher dimensions
摘要：
Schwenk在1991年解决了矩形棋盘上的闭骑士之旅的存在性问题。去年，在2011年，DeMaio和Mathew将这个结果扩展到了三维矩形板。本文给出了$n$ -维矩形板的解，对于$n\geq 4$ .
英文摘要：
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$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
