An Almost Perfect Heuristic for the N Nonattacking Queens Problem

@article{Kal1990AnAP,
  title={An Almost Perfect Heuristic for the N Nonattacking Queens Problem},
  author={Laxmikant V. Kal{\'e}},
  journal={Inf. Process. Lett.},
  year={1990},
  volume={34},
  pages={173-178}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Parallel state - space search for a first solution , Rept

  • L. V. KalC
  • 1989

Similar Papers

Loading similar papers…