Mathematics – Combinatorics
Scientific paper
2012-02-23
Mathematics
Combinatorics
This is a merged version of the previous version and the approach of Erde arXiv:1202.5548
Scientific paper
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$.
Erde Joshua
Golenia Bruno
Golenia Sylvain
No associations
LandOfFree
The closed knight tour problem in higher dimensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The closed knight tour problem in higher dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The closed knight tour problem in higher dimensions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-77501