骑士之旅在更高的维度
Knight's Tours in Higher Dimensions
摘要:
本文研究了高维棋盘上的骑士之旅。我们的主要目的是表明,在$d$ -维板$[n]^d$,与$n$甚至,总是有一个骑士的旅游提供$n$是足够大的。事实上,我们给出了一个确切的分类网格$[n_1] \times ... \times [n_d]$,其中有一个骑士的旅游。这回答了DeMaio,DeMaio和Mathew以及Watkins的问题。
英文摘要:
In this paper we are concerned with knight's tours on high-dimensional boards. Our main aim is to show that on the $d$-dimensional board $[n]^d$, with $n$ even, there is always a knight's tour provided that $n$ is sufficiently large. In fact, we give an exact classification of the grids $[n_1] \times ... \times [n_d]$ in which there is a knight's tour. This answers questions of DeMaio, DeMaio and Mathew, and Watkins.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。