Introduction - If you have any usage issues, please Google them yourself
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.