不定重循环问题及程序设计  

Non-definite Loops Problems and Its Program Design

作　　者：熊华[1] 张世禄[1] 

机构地区：[1]西华师范大学数学与信息学院,四川南充637002

出　　处：《西南科技大学学报》2008年第3期84-89,共6页Journal of Southwest University of Science and Technology

摘　　要：指出回溯法应更名为不定重循环算法更为恰当。通过两个典型实例:N张骨牌覆盖问题和N阶拉丁阵问题,归纳出不定重循环算法的计算过程和程序的基本结构。得到了一个有意义的数学结论:N张骨牌覆盖问题中覆盖数组成的数列为菲波拉契数列。It is proper to rename trace back method as non-definite loops method. Through two representative problems ： N -dominos coverage problem and N -order Latin matrix problem, the paper concluded the computing procedure and basic structure of the non-definite loops method. A meaningful mathematic conclusion is drawn from the N-dominos coverage problem that the coverage numbers are Fibonacci series.

关 键 词：不定重循环算法 N张骨牌覆盖问题 N阶拉丁阵问题 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]