How to search for millions of queens

Update item information
Publication Type Journal Article
School or College College of Engineering
Department Computing, School of
Creator Gu, Jun
Other Author Sosic, Rok
Title How to search for millions of queens
Date 1988
Description The n-queens problem is a classical combinatorial problem in artificial intelligence (AI) area. Since its simplicity and regular structure, this problem has widely been chosen as a testbed to develop and benchmark new AI search problem-solving strategies in the AI community. Due to its inherent complexity, so far even very efficient AI search algorithms can only find a solution for n-queens problem with n up to about 100. In this manuscript we present a new probabilistic local search algorithm which is based on a gradient-based heuristic. This efficient algorithm is capable of finding a solution for over 1,000,000 queens in several CPU hours on a 25Mhz Motorola 68030 computer.
Type Text
Publisher University of Utah
First Page 1
Last Page 16
Subject Combinatorial problems; n-queens; Search algorithms
Language eng
Bibliographic Citation Sosic, R., & Gu, J. (1988). How to search for millions of queens. 1-16. UUCS-88-025.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 1,089,718 bytes
Identifier ir-main,16158
ARK ark:/87278/s6b28cpv
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2015-04-27
ID 705175
Reference URL https://collections.lib.utah.edu/ark:/87278/s6b28cpv
Back to Search Results