Author: Frederick Wu
Date: 2010-08-15
Knight's tour is a classic problem in computer science, the target is to find a sequence
of path
by a knight chess piece, which moves on chess broad with 8×8 square grid,
such that each
node of the board is visited exactly once.
This Demonstrations explores the knight's tour problem on the Chinese chess broad
(also
called Xiangqi) with 9×10 rectangle grid. The chess piece of knight is named horse
or "Ma",
correspondingly.
fig 1. intial position of horse fig 2. run a knight(horse) tour
"Thus tomorrow, as I have said, will be accomplished what I so much desire,enabling me lawfully to roam through all the four quarters of the world seekingadventures on behalf of those in distress, as is the duty of chivalry of knights-errant like myself, whose ambition is directed to such deeds."--- Don Quixote, Chapter 3, Miguel de Cervates, 1615, Translated by John Ormsby.
fig 3. accomplish the knight(horse) tour
Download: