Description: 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 visited (Parade) Each board in the first place. 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.)
To Search:
File list (Check if you may need any files):
骑士巡游2.cpp
骑士巡游2.dsp
骑士巡游2.dsw
骑士巡游2.exe
骑士巡游2.ncb
骑士巡游2.opt
骑士巡游2.plg
Download