Description: Write a program for solving the Knight Parade ": n lines n columns on the board (eg, n = 5), assuming that a knight (chess" horse walk "walking method) from the initial coordinate position (x,y), starting to be visited (parade) board in each position and only once. Please compile a program, and solving for Knight Parade "road map" (or tell the knight, starting from a position can not be visited the whole board- no solution). Since n is relatively large when the output result will be a lot of that running time is very long, has no real meaning, so this procedure only when n = 5.
To Search:
File list (Check if you may need any files):
0810610.cpp
Download