国际象棋中马的周游路线问题新解法

A New Algorithm for Travel Route Problem of Horse in Chess

摘要: 本文对国际象棋中马的周游路线问题进行了分析，设计了基于回溯法和最优选择法的算法，对回溯过程中不同活结点的通路数量进行排序，并将通路数目最少的活结点作为当前的最优选择，从而进一步提高回溯法的效率。文中给出了算法的具体实现过程，实验结果验证了算法的有效性。

Abstract: The travel route problem of horse in chess was brought up in this paper. An efficient algorithm was proposed based on recursive algorithm of backtracking and bestchoicing. The path number of living nodes is sorted in the algorithm of backtracking to improve the efficiency, and the one who has the fewest path number will be the best choice. Implementation procedure is given in this paper, and simulation results show it is effective.