# Knight's tour

• Last updated on 7/31/07, 11:00 PM.

• Send to friend

The “Knight’s Tour” is an ancient chess puzzle in which the object is to move a knight, starting from any square on a chess board, to every other square, landing on each square only once.  The Knight’s Tour problem fascinated the mathematician Leonhard Euler, who solved it mathematically in 1759.  He was the first to write a mathematical paper on the knight’s tour.  In 1817 Charles Babbage wrote about the knight’s tour in the Journal of Science and the Arts in London.   The number of possibilities of a knight's tour is over 122 million.

• 2 years ago · Quote · #21

Here is another version start
on D8, E8 or H8 and follow the
colors. Go ahead, copy it and print it out.
• 2 years ago · Quote · #22

Here is the one called "The Turk's Tour"

Copy it if you want to. Just follow the colors.

Start on D8   F8  or   H8
• 2 years ago · Quote · #23

I completed the Knights tour after 5 attempts. The key is to start on the outside working alternately and work your way to the centre. It's tricky though.

• 23 months ago · Quote · #24

denver is awsome i saw one mistake

• 22 months ago · Quote · #25

Ha ha! Bishop's tour!

• 19 months ago · Quote · #26

It will help you learn how to map your knights. Bishops can't tour because they don't have access to dark and light squares. Bosco, the king would b the easiest tour silly. That ones a no brainer. So is the queen. So is the rook. Pawns can't touch every square, either. The only piece that can touch every square on the board without making illegal moves is the knight. It's pointless with king, rook, or queen. Start at a1 on the first rank. Then then move one square at a time to the right. Then advance to the next row n repeat those steps.