Description: Question:
The knights in chess move on an empty board. Ask it to start at a certain point, can it go through every lattice of 64 lattice, and only pass once?
My algorithm:
Knights on the board of a point can be moved to the next point has eight (of course some edge and corner position don't have much choice, but if the board extends seems they still can choose eight directions, but some position beyond the chessboard.). Knight move will be under a little at a time can move, according to a pre-arranged sequence (clockwise or counterclockwise or other better optimization algorithm of order) to see if I can go to the next point, if they can walk will knight move to that point, and then go the next step; It's possible that this point has already crossed the board boundary or has already gone past once, then make a judgment on the next point; If all eight options are not feasible, the knight returns a step further from the current position.
To Search:
File list (Check if you may need any files):
Download