By Topic

Fast search algorithms for the n-queens problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Sosic ; Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT ; J. Gu

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

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:21 ,  Issue: 6 )