How far can a knight travel without visiting the same square twice?
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.