A Polynomial Time Algorithm for the N-Queens Problem (1990)
by
Rok Sosic
,
Jun Gu
| Citations: | 28 - 4 self |
BibTeX
@MISC{Sosic90apolynomial,
author = {Rok Sosic and Jun Gu},
title = {A Polynomial Time Algorithm for the N-Queens Problem},
year = {1990}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper we present a new, probabilistic local search algorithm which is based on a gradient-based heuristic. This efficient algorithm is capable of finding a solution for extremely large size n-queens problems. We give the execution statistics for this algorithm with n up to 500,000. Keywords: Artificial intelligence (AI), combinatorial search, gradient-based heuristic, local search, the n-queens problem, nonbacktracking search, fast search algorithm. 1
Citations
| 412 | Increasing Tree Search Efficiency for Constraint Satisfaction Problems - Haralick, Elliot - 1980 |
| 360 | Network-based heuristics for constraint satisfaction problems - Dechter, Pearl - 1987 |
| 157 | Performance Measurement and Analysis of Certain Search Algorithms - Gaschnig - 1979 |
| 35 | Representation Selection for Constraint Satisfaction: A Case Study using n-Queens - Nadel - 1990 |
| 29 | Efficient search techniques - An empirical study of the n-queens problem - Stone, Stone - 1987 |
| 16 | Mathematische Unterhaltungen und Spiele - Ahrens - 1910 |
| 13 | The average complexity of depth-first search with backtracking and cutoff - Stone, Sipala - 1986 |
| 9 | How to search for million queens - Sosic, Gu - 1988 |
| 5 | Tables of Random Permutations - Moses, Oakford - 1963 |
