A Parallel Search Algorithm for the N-Queens Problem (1991)
| Venue: | IEEE Transactions on Systems, Man, and Cybernetics |
| Citations: | 3 - 1 self |
BibTeX
@ARTICLE{Sosic91aparallel,
author = {Rok Sosic},
title = {A Parallel Search Algorithm for the N-Queens Problem},
journal = {IEEE Transactions on Systems, Man, and Cybernetics},
year = {1991},
volume = {21},
pages = {Nov/Dec}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The N-queens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the N-queens problem. The algorithm finds a solution by performing a probabilistic parallel search. By using n processors, its running time is O(log 2 n). The algorithm demonstrates a new practical approach to tackle large scale CSP on parallel computers. 1 Introduction The N-queens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. The problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). Although direct applications of the N-queens problem are limited, studies of the problem produced several practical results that are useful in dealing with large CSP [9, 10, 11, 12]. The problem continues to serve as a testbed...
Citations
No citations identified.
