Description: Checkerboard algorithm, given the size of the square-shaped board, will be a pawn of " horses" on the specified start position, the pieces of " horses" take the child must be the rules of the board to the " day" word from a pawn " horses, " starting position of the beginning, search out a feasible path, makes the piece" Horse " can be traveled on board all the Lazi, and they can only go once every Lazi point
To Search:
File list (Check if you may need any files):
chess\chess.aps
.....\chess.clw
.....\chess.cpp
.....\chess.dsp
.....\chess.dsw
.....\chess.h
.....\chess.ncb
.....\chess.opt
.....\chess.plg
.....\chess.rc
.....\chessDlg.cpp
.....\chessDlg.h
.....\Debug\chess.exe
.....\.....\chess.ilk
.....\.....\chess.obj
.....\.....\chess.pch
.....\.....\chess.pdb
.....\.....\chess.res
.....\.....\chessDlg.obj
.....\.....\StdAfx.obj
.....\.....\vc60.idb
.....\.....\vc60.pdb
.....\ReadMe.txt
.....\res\chess.ico
.....\...\chess.rc2
.....\resource.h
.....\StdAfx.cpp
.....\StdAfx.h
.....\Debug
.....\res
chess
Download