An Almost Perfect Heuristic for the N-queens Problem
Information Processing Letters (Information Processing Letters) 1990
Publication Type: Paper
Repository URL:
Abstract
We present a heuristic technique for finding solutions to the N nonattacking queens problem that is almost perfect in the sense that it finds a first solution without any backtracks in most cases. In addition to previously known variable-ordering heuristics and their extensions, it uses a value-ordering heuristic, which contributes dramatically to its success. Using these heuristics, solutions have been found for all values of N between 4 and 1000.
TextRef
L.V. Kale, "An Almost Perfect Heuristic or the N-queens Problem", Information Processing Letters, Publ: North Holland, vol. 34, pp. 173-178, April 1990.
People
Research Areas