Different perspectives of the N-Queens problem
Different perspectives of the N-Queens problem
复制标题
N 皇后问题的不同视角
DOI：
--
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
Murat M. Tanik
中科院分区：
文献类型：
--
作者：
Cengiz Erbas;Seyed Sarkeshik;Murat M. Tanik
N-皇后问题是计算机科学中常用的例子。提出了多种方法来解决该问题。我们介绍了问题的几个定义，并回顾了一些算法。我们将 N-Queens 问题的算法分为 3 类。第一类包括为给定 N 生成所有解决方案的算法。第二类算法旨在仅生成基本解决方案 [34]。最后一类的算法仅生成一个或多个解决方案，但不一定生成全部解决方案。
The N-Queens problem is a commonly used example in computer science. There are numerous approaches proposed to solve the problem. We introduce several definitions of the problem, and review some of the algorithms. We classify the algorithms for the N-Queens problem into 3 categories. The first category comprises the algorithms generating all the solutions for a given N. The algorithms in the second category are desinged to generate only the fundamental solutions [34]. The algorithms in the last category generate only one or several solutions but not necessarily all of them.