首页 | 本学科首页   官方微博 | 高级检索  
     

元皇后问题回溯算法改进
引用本文:钱卫,张钟澍,张奎良. 元皇后问题回溯算法改进[J]. 四川大学学报(自然科学版), 2009, 46(2): 339-342
作者姓名:钱卫  张钟澍  张奎良
作者单位:成都信息工程学院计算机系,成都,610225
基金项目:四川省教育厅自然科学重点项目(072A014)
摘    要:回溯算法是解决N元皇后问题最有效的算法之一.在传统回溯算法的基础上,采用动态规划的思想,对算法进行了改进,改进后的算法大大降低了求解的复杂度和比较次数.文章还给出了改进算法的实现并通过理论分析和实验数据证明了算法的可行性.

关 键 词:回溯算法  皇后问题  动态规划

Solving N-queens problem by using improved backtracking algorithm
QIAN Wei,ZHANG Zhong-Shu and ZHANG Kui-Liang. Solving N-queens problem by using improved backtracking algorithm[J]. Journal of Sichuan University (Natural Science Edition), 2009, 46(2): 339-342
Authors:QIAN Wei  ZHANG Zhong-Shu  ZHANG Kui-Liang
Affiliation:Chengdu University of Information Technology;Chengdu University of Information Technology;Chengdu University of Information Technology
Abstract: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.
Keywords:backtracking-algorithm  N-queens problem   dynamic-programming
本文献已被 万方数据 等数据库收录!
点击此处可从《四川大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《四川大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号