用勾连法解决8m×8n棋盘上的马周游闭路问题

RESOLVING KNIGHT TOUR PROBLEM BY USING HOOKING METHOD

马周游路线问题是图论中最著名的经典问题之一，多年来吸引了众多的研究者．某些文献曾给出一些马的周游路线．本文将给出一种新解法——勾连法，它更简单，更自然，更好理解，更有效，能在一个小时内计算出上千个周游闭路．更为重要的是，这种方法推广到８ｍ×８ｎ的大棋盘上（ｍ和ｎ是任意正整数），也能找出上千个周游闭路，而且随ｍ和ｎ的增加，所用时间并没有明显增加．

Knight Tour' is one of the most famous problems in the classical graph theory. In the past long time it had a strong appeal to a lot of researchers. Some papers gave a few heuristic search methods,by which some knight tour paths might be found. This paper presents a new method-hooking method. which is more simple, more natural, easier to understand, more effective, by which thousands of solutions can be gotten in a short time. It is more important that thousands of tour closed paths may be also gotten quickly when the method may be applied on the bigger chess board of size 8m×8n. Therefore it solves the Knight Tour problem on the 8m×8n board successfully.