Description: Knight Parade programming to solve the problem: In the n-n chessboard (for example, n = 5), assuming a knight (in chess in the " horse to go on" walk method) from the initial coordinates (x1, y1) starting , to be visited (cruise) position in each of the board once. Please compile a program to solve for the Knight Parade " road map" (or tell the knight, starting from a position, you can not visited the board- problem has no solution.) When n = 5, meaning 5 rows 5 columns in the board' s 25 " points" at, according to Knight walking rule, in turn 1 to 25 of these 25 " pieces" (digital) were placed into the board ( 25 positions were filled with success, or failure problem has no solution.)
To Search:
File list (Check if you may need any files):
骑士巡游.cpp
1-6骑士巡游.cpp
Download