棋盘算法，在给定大小的方格状棋盘上, 将棋子”马”放在指定的起始位置 , 棋子”马” 的走子的规则为必须在棋盘上走”日”字 从棋子”马”的起始位置开始, 搜索出...

棋盘算法，在给定大小的方格状棋盘上, 将棋子”马”放在指定的起始位置 , 棋子”马” 的走子的规则为必须在棋盘上走”日”字 从棋子”马”的起始位置开始, 搜索出一条可行的路径, 使得棋子”马”能走遍棋盘上的所有落子点, 而且每个落子点只能走一次 -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

chess
res
Debug
chess.aps
chess.clw
chess.cpp
chess.dsp
chess.dsw
chess.h
chess.ncb
chess.opt
chess.plg
chess.rc
chessDlg.cpp
chessDlg.h
ReadMe.txt
resource.h
StdAfx.cpp
StdAfx.h