N皇后问题独立解算法研究和仿真实现  

Research on the Independent Solution Algorithm and the Simulation of N-queens Problem

作　　者：温录亮[1] 柯振钦[1] 邹俊飞[1] 

机构地区：[1]佛山科学技术学院计算机系,广东佛山528000

出　　处：《电脑与电信》2013年第5期44-46,共3页Computer & Telecommunication

摘　　要：根据N皇后可行解的七种对称关系,提出求N皇后问题独立解的算法,并验证算法的可行性和正确性。建立求解N皇后问题的仿真软件,验证N皇后问题全解和独立解个数约8:1的数学关系。According to the seven symmetrical relationships of the N Queen feasible solutions, this paper proposes an efficient algorithm about the independent solutions of N-queens problem, verifying the feasibility and correctness of the algorithm. It builds the simulation sottware to solve N Queen＇s problem. The mathematical relationship is verified that the number of the whole solutions and the independent solutions is about 8： 1.

关 键 词：N皇后问题 独立解算法 仿真软件 数学关系 

分 类 号：O242.23[理学—计算数学]