摘要
马周游路线问题是图论中的经典问题之一，多年来吸引了众多的研究者。某些文献中曾列举了一些寻找马周游路线的探索式算法，从中可以找到一些马的周游路线。本文提出了两种新解法──拉门法和勾连法，其构思巧妙执行有效，能在很短的时间里算出上千个马的周游路线和周游闭路。两种方法都具有普遍性，可以用来解决更大棋盘上的马周游路线问题。
The knight tour problem is one of the classical problems, which had a strong appeal to a lot of researchists in the past. Some papers gave a few of probe algorithms whichmight find tour paths for the knight on the chess board. This paper presents two newalgrithms: 'the drawing door' and ' the hooking', which are clever and effective, and areable to get thousands of knight tour paths and cycles in a short time. Both of them have universility, and can be used to resolve the knight tour problem on the bigger board.
出处
《小型微型计算机系统》
CSCD
北大核心
1996年第8期51-59,共9页
Journal of Chinese Computer Systems
关键词
解法
棋盘
研究者
路线
文献
新解
探索
寻找
Knight tour problem, Hamiltonian path, Hamiltonian cycle, Back tracking methods, Drawing door method, Hooking methed
