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.
If you start with a night on a square, it will take you exactly 63 moves. This is called the Knights tour. There is a very detailed Youtube video describing Knight's tour. But to answer your question: 63 moves.