Knight tour problem

Say you have an empty chess board, and you have been giving a knight. And you ask, to move the knight in such a way that the knight will touch each square on the board once and once only. I believe this is possible. Is there any algorithm to make this possible.

Topic archived. No new replies allowed.