x
Chess - Play & Learn

Chess.com

FREE - In Google Play

FREE - in Win Phone Store

VIEW

Knight's tour

The “Knight’s Tour” is an ancient chess puzzle in which the object is to move a knight, starting from any square on a chess board, to every other square, landing on each square only once.  The Knight’s Tour problem fascinated the mathematician Leonhard Euler, who solved it mathematically in 1759.  He was the first to write a mathematical paper on the knight’s tour.  In 1817 Charles Babbage wrote about the knight’s tour in the Journal of Science and the Arts in London.   The number of possibilities of a knight's tour is over 122 million.

Online Now