# Knight’s Tour

If you are interested in Chess, you may have come across Knight’s Tour problem before.

Your task is to take a knight and place it anywhere on the chess board. Then, by performing legal Knight’s moves. can you visit each square on the chess board? Moreoever, you are only allowed to visit each square once (so 64 moves)?

If you end up at the final square, and it would be possible to move to your starting square with a legal Knight’s move, this is know as a close tour. Mathematicians would also recognise this as a Hamiltonian Path.

If you end up on a square where it is not possible to get to your starting position (via a legal Knight’s move) this is know as an open tour.

When you first see this problem, you tend to think that it would be impossible to find any tour, whether open or closed.

You might be surprised to learn that there are 26,534,728,821,064 closed tours. Yes, that’s right, 26 TRILLION of these tours. So if you tried it and could not find one, then shame on you :-).

How many open tours do you think there are? At the time of writing, nobody knows!

The video below does the job of exaplaining Knight’s Tours much better than I can, and it also includes some extra information about semi-magical squares.

I have a particular interest in this video and I had some discussions with Brady Haran (the producer of this series) as I have published a couple of papers on this topic (see here and here) , where we used ants to find Knight’s tours.