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 ≥ 4.
| Original language | English |
|---|---|
| Journal | Electronic Journal of Combinatorics |
| Volume | 19 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 25 Oct 2012 |
Keywords
- Chessboard
- Hamiltonian cycle
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'The closed knight tour problem in higher dimensions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver