计算机与数字工程2011，Vol.39Issue(1)：42-44,82,4.
基于位运算的N皇后问题的解法
Solution of N Queen Problem Basied on the Bit Operation
熊金平 1唐郑熠2
作者信息
- 1. 贵阳同心软件科技有限公司,贵阳,550003
- 2. 贵州大学计算机科学与信息学院,贵阳,550003
- 折叠
摘要
Abstract
Commonly, programers use backtracking to solve N queen problem. The general approach is to use array to simulate chessboard, but it is not effective. The solution of N queen problem basing on the bit operation makes the row conflict translate into column conflict, uses binary integer to simulate set, and uses bit operation to implement set operation.The result of program proves that this solution can be more efficiency.关键词
N皇后/回溯法/集合/位运算/对称性分类
信息技术与安全科学引用本文复制引用
熊金平,唐郑熠..基于位运算的N皇后问题的解法[J].计算机与数字工程,2011,39(1):42-44,82,4.
