骑士巡游（knight s tour）问题，自从十八世纪初以来，这个问题吸引了数学家们的兴趣，也使热心者们感到困惑。简而言之，这个问题要求从棋盘上任意给定的方格开始移动骑士，相继地到达所有的64个方格，进入每个方格一次且仅进入一次。

This a python program, solving the knight s tour riddle recursively.-This is a python program, solving the knight s tour riddle recursively.

骑士巡游游戏，程序给出了实现方法，使骑士总是移向具有最少出口且没有到达过的方格之一-The Knight Parade game program given the ways in which Knight always move to one of the least export and did not reach the checkered