Efficient Local Search with Conflict Minimization: A Case Study of the N-Queens Problem (1994)
| Venue: | IEEE Transactions on Knowledge and Data Engineering |
| Citations: | 27 - 6 self |
BibTeX
@ARTICLE{Sosic94efficientlocal,
author = {Rok Sosic and Student Member and Jun Gu and Senior Member},
title = {Efficient Local Search with Conflict Minimization: A Case Study of the N-Queens Problem},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {1994},
volume = {6},
pages = {661--668}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Backtracking search is frequently applied to solve a constraint-based search problem but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search based on conflict minimization. We have applied this general search framework to study a benchmark constraint-based search problem, the n-queens problem. An efficient local search algorithm for the n-queens problem was implemented. This algorithm, running in linear time, does not backtrack at all. It is capable of finding a solution for extremely large size n-queens problems. For example, on a workstation computer, it can find a solution for 3,000,000 queens in less than 55 seconds. Keywords: conflict minimization, local search, n-queens problem, nonbacktracking search. 1 This research has been supported in part by the University of Utah research fellowships, in part by the Research Council of Slovenia, and in part by ACM/IEEE academic scholarship awards. 1 Introduction A ...
