文件名称：Knight Moves
文件大小：17KB
文件格式：ZIP
更新时间：2017-06-19 13:26:04
Knight Moves问题
Your task is to write a program to calculate the minimum number of moves移动次数 needed for a knight to reach one point from another, so that you have the chance to be faster than Somurolov. For people not familiar with chess, the possible knight moves are shown in Figure 1.
【文件预览】：
Knight Moves问题
----Graph.h(220B)
----inPutData.txt(47B)
----text.cpp(1KB)
----Graph.cpp(1KB)
----Knight Moves.doc(35KB)