摘要
回溯算法是解决N元皇后问题最有效的算法之一。在传统回溯算法的基础上,采用动态规划的思想,对算法进行了改进,改进后的算法大大降低了求解的复杂度和比较次数。文章还给出了改进算法的实现并通过理论分析和实验数据证明了算法的可行性。
Backtracking algorithm is one of the efficient methods to solve N-queens problem. Based on the solving N-queens problem by using backtracking algorithm, the thinking of the dynamic programming was introduced to improve the algorithm, and the complexity of the solution and comparative number was greatly reduced. At the same time, the concrete realization of the improved Non-recursive algorithm was implemented and the feasibility of this algorithm was proved through theoretical analysis and experimental data in the paper.
出处
《四川大学学报(自然科学版)》
CAS
CSCD
北大核心
2009年第2期339-342,共4页
Journal of Sichuan University(Natural Science Edition)
基金
四川省教育厅自然科学重点项目(072A014)
关键词
回溯算法
皇后问题
动态规划
backtracking-algorithm
N-queens problem
dynamic-programming