1
$\begingroup$

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.

$\endgroup$
  • 1
    $\begingroup$ 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 $\endgroup$ – Wojowu May 10 '15 at 6:59
  • 1
    $\begingroup$ Is the answer $64-1$? A knight only moves to one square at a time. $\endgroup$ – Rebecca J. Stones May 10 '15 at 10:21
2
$\begingroup$

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.

$\endgroup$
  • $\begingroup$ (Though, if the starting position counts as a "move," that'd make it 64.) $\endgroup$ – Akiva Weinberger Jul 21 '15 at 3:04

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.