骑士巡游算法（可以向八个方向移动,搜索所有可行路径. 用二维链表存储结果）,Cavalier Parade algorithm (moving to eight, search all possible paths. With two-dimensional chain store results)

八数码（启发式和广度优先搜索两种方法实现）+骑士巡游+比赛日程安排等经典问题的C++源代码-the source code of some classic problems, such as 8 puzzle question, Knight Parade, and Competition Schedule.

骑士巡游的java的程序源代码,跟马踏格子是一样的()