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

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!