骑士巡游问题的算法。骑士巡游的问题简述如下：在国际象棋攀上某一位置放置一个马的棋子，然后采用象棋中“马走日字”股则，要求这匹马能不重复地走完25个格子。本实例用枚举方法求解骑士巡游问题。程序可自定义棋盘的大小，先输出标志矩阵，然后输入骑士在棋盘的初始位置，即可给出其中的一种解法。-Knight Parade algorithm problem. Knight Parade problems are summarized as follows: Place a horse chess piece on climbing a location, and then using chess " horse to go on the word"　shares, requiring repeated this horse can not finish the 25 squares. The examples of enumeration method for solving the problem knights parade. Program can be custom-sized chessboard, the first output flag matrix, and then enter the initial position of the knight on the board, you can give them a solution.