Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1145/131214.131227 | ACM Conference on Computer Science |
Keywords | Field | DocType |
which was germinated from the 8- queensproblem,last category,has been studied for more than a century,o. introduction the n-queens problem,numerous approach,computer science,n-queens problem,different perspective,fundamental solution,tuple space | Tuple space,Transputer,Computer science,Theoretical computer science,Eight queens puzzle,Artificial intelligence,Parallel lisp | Conference |
ISBN | Citations | PageRank |
0-89791-472-4 | 14 | 3.13 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cengiz Erbas | 1 | 32 | 8.33 |
| Seyed Sarkeshik | 2 | 14 | 3.13 |
| Murat M. Tanik | 3 | 222 | 28.08 |