A Chinese Knight's Tour
A Chinese Knight's Tour
A knight's tour is a sequence of knight's moves that visit each square of an 8×8 chessboard once and only once. Finding knight's tours is a classic problem in computer science.
This Demonstration explores the knight's tour problem on the Chinese chessboard (also called Xiangqi), which is played on a 9×10 rectangular grid. The chess piece is called the horse (or "Ma").