Q:

How far can a knight travel without visiting the same square twice?

How many Knight moves is it possible to execute on an empty chess board before the Knight lands on a square it has already landed on in its previous moves?  The most I've ever been able to land on was 54 squares, usually 50-52.

A:

There is a famous puzzle called the Knight's Tour in which the aim is to visit every square exactly once.  Since this has several solutions, the answer to your question is that it can visit all 64 squares.

