Fast Search Algorithms for the N-Queens Problem (1991)
| Venue: | IEEE Trans. on Systems, Man, and Cybernetics |
| Citations: | 7 - 3 self |
BibTeX
@ARTICLE{Sosic91fastsearch,
author = {Rok Sosic and Jun Gu},
title = {Fast Search Algorithms for the N-Queens Problem},
journal = {IEEE Trans. on Systems, Man, and Cybernetics},
year = {1991},
volume = {21},
pages = {1572--1576}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper we present two new algorithms, called Queen Search 2 (QS2) and Queen Search 3 (QS3). QS2 and QS3 are probabilistic local search algorithms, based on a gradient-based heuristic. These algorithms, running in almost linear time, are capable of finding a solution for extremely large size n-queens problems. For example, QS3 can find a solution for 500,000 queens in approximately one and a half minutes. Keywords: Artificial intelligence (AI), combinatorial search, local search, n-queens problem. 1
