国际象棋游戏一个经典的例子就是骑士巡游（knight s tour）问题，这个问题要求从棋盘上任意给定的方格开始移动骑士，相继地到达所有的64个方格，进入每个方格一次且仅进入一次。通常情况下，我们用如下方法表示一个解：即把数字0，1，…，63放入棋盘中的方格来表示到达这些方格的顺序。解决骑士巡游问题更具创意的方法之一是由J. C. Warnsdorff在1823年提出的。其规则是：骑士总是移向具有最少出口且没有到达过的方格之一-Chess game is a classic example of Cavalier Parade (knight s tour) issue request from the board on any given grid Cavalier began to move, one after another to reach all 64 boxes, each box to enter the first and only entered once. Under normal circumstances, we use the following method to represent a solution: that is, the figures 0,1, ..., 63 Add chessboard grid of these squares to indicate the order of arrival. To resolve the issue of Cavalier parade one of the ways to be more creative by JC Warnsdorff raised in 1823. Its rules are: Cavalier always have at least moved towards exports and the box had not arrived at one of