Description: Knight Parade programming to solve the problem: in n rows n columns of the board (such as n = 5), assuming a knight (in chess in the "horse to go on" walking method) from the initial coordinates (x1, y1) starting , to be sung (Parade) board in the position of each of the first. Please compile a program to solve for the Knight Parade "road map" (or tell the knight, starting from a position when not visiting with the board- the problem no solution).
To Search:
File list (Check if you may need any files):
qishixunyou\Debug\ba_queen.obj
...........\.....\qishixunyou.obj
...........\.....\qishixunyou.pch
...........\.....\qishixunyou.pdb
...........\.....\vc60.idb
...........\.....\vc60.pdb
...........\qishixunyou.cpp
...........\qishixunyou.dsp
...........\qishixunyou.dsw
...........\qishixunyou.ncb
...........\qishixunyou.opt
...........\qishixunyou.plg
...........\Debug
qishixunyou
Download