# movement of knight in a game of chess

This question arose in my brain while playing a game of chess. We all know how a knight moves in a game of chess. I wanted to calculate the minimum no. of moves required by a knight to cover all the 64 squares of the chess board. I didn't know how to proceed to calculate this. Please help me.

• What do you mean by knight "covering" squares? Do you mean knight visiting every square? If so, then you mean this: en.wikipedia.org/wiki/Knight%27s_tour – Wojowu May 10 '15 at 6:59
• Is the answer $64-1$? A knight only moves to one square at a time. – Rebecca J. Stones May 10 '15 at 10:21