We know that a normal knight can traverse a normal chessboard, landing on each square exactly once. Here is one such route:
Then, can a knight which travels twice as far per jump (compared to a normal knight) traverse a board, landing on each square exactly once?
This problem is part of the Knight Knight Sleep Tight set.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
A super knight would start and end on the same color square with each jump. So it could never complete a tour of any size chess board.