The Knight's Tour 2

 

after Martin Gardner

Home
Home / Puzzle Playground / Puzzles / Chess 'n' Checkers /

What is the longest possible route without self-crossings for the chess knight to travel on the 6x6 board shown in Figure 1?

To see what the route "without self-crossings" means, let's show any route of the knight by drawing on the board a broken line that will join the centers of the successive cells visited by the knight. The examples of such lines for a single move of the knight are shown in Figure 2.

Now for a 4x4 board such a route without self-crossing may be shown as that in the diagram on the right. This 5-move route is the longest possible for this small board; not unique, though.

There is a 16-move route for a 6x6 board. Try to find it.

After that try to improve this route adding to it one more move. This new 17-move route makes the longest possible tour of the chess knight without self-crossing for a 6x6 board. It's unique, and hard to find. Can you discover it?

To practice you may use the 6x6 board from our special
Print 'n' Play PDF Version and a chess knight (or a simple coin).

Last Updated: October 24, 2006
Puzzle
Solution
Download
PDF Version (239 KB)

Step Through:

The Two Queen Question   Three Queens
< Previous Next >
Discover More

 
< Home   |   Our Privacy Policy   |   About Puzzles.COM   |   Link to Us   |   Contact Us
Copyright 1995-2006 ThinkFun Inc. All Rights Reserved.
ThinkFun - Everybody plays.