What is Knight's tour?
[[Image:Knight's tour anim 2.gif|right|thumb|250px|An open knight's tour of a chessboard]] A '''knight's tour''' is a set of moves of a [[knight (chess)|knight]] on a [[chessboard]]. The knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is ''closed'', otherwise it is ''open''. The '''knight's tour problem''' is the [[Mathematical chess problem|mathematical problem]] of finding a knight's tour. Making a program to find a knight's tour is a common problem given to [[computer science]] students.<ref>{{cite book|first1=H. M.|last1=Deitel|first2=P. J.|last2=Deitel|title=Java How To Program Fifth Edition. |url=https://archive.org/details/javahowtoprogram00deit_1|publisher=Prentice Hall|isbn=978-0131016217|edition=5th|pages=[https://archive.org/details/javahowtoprogram00deit_1/page/326 326]–328|date=2003}}</ref> Variations of the knight's tour problem involve chessboards of different sizes than the usual {{nowrap|8 × 8}}, as well as irregular (non-rectangular) boards. ==References== {{reflist}} {{stub}} [[Category:Chess]] [[Category:Puzzles]]