The Closed Knight Tour Problem in Higher Dimensions

  • Joshua Erde
  • Bruno Golénia
  • Sylvain Golénia
DOI: https://doi.org/10.37236/2272
Keywords: Chessboard, Hamiltonian cycle

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$.
Published
2012-10-25
How to Cite
Erde, J., Golénia, B., & Golénia, S. (2012). The Closed Knight Tour Problem in Higher Dimensions. The Electronic Journal of Combinatorics, 19(4), P9. https://doi.org/10.37236/2272
Issue
Volume 19, Issue 4 (2012)
Article Number
P9