从跳马问题说起——兼谈程序设计中的递归调用

Begin with the "Knight Tour" Problem ——and also the recursive call in programming

阐述了解决跳马问题的方法,并给出完整的解决此问题的PASCAL源程序,又就递归算法的条件、变量使用和优缺点等方面进行了论述。

This paper states the method of solving the 'Knight Tour' problem, gives out a whole PASCAL source routine and discusses the recursive algorism's conditions, the usage of variables, the merits and demerits, etc.