A Chinese Knight's Tour

http://demonstrations.wolfram.com/ACh... The Wolfram Demonstrations Project contains thousands of free interactive visualizations, with new entries added daily. A knight's tour is a sequence of knight's moves that visit each square of an 8x8 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 chessbo... Contributed by: Frederick Wu Based on Demonstrations by: Jay Warendorff