Fast search algorithms for the n-queens problem

Fast search algorithms for the n-queens problem

The n-queens problem is to place n queens on an n*n chessboard so that no two queens attack each other. The authors 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 algo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on systems, man, and cybernetics man, and cybernetics, 1991-11, Vol.21 (6), p.1572-1576
Hauptverfasser: Sosic, R., Gu, J.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Artificial intelligence
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic algorithms
Microcomputers
Operational research and scientific management
Operational research. Management science
Optical computing
Routing
Search problems
Testing
Two dimensional displays
Ultraviolet sources
Very large scale integration
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The n-queens problem is to place n queens on an n*n chessboard so that no two queens attack each other. The authors 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 n-queens problems. For example, QS3 can find a solution for 500000 queens in approximately 1.5 min.< >
ISSN:0018-9472
2168-2909
DOI:10.1109/21.135698