Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Sosic, R. ; Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT ; Gu, J.

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:

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