Efficient Search Techniques - An Empirical Study of the N-Queens Problem

@article{Stone1987EfficientST,
  title={Efficient Search Techniques - An Empirical Study of the N-Queens Problem},
  author={Harold S. Stone and Janice M. Stone},
  journal={IBM Journal of Research and Development},
  year={1987},
  volume={31},
  pages={464-474}
}
This paper investigates the cost of finding the first solution to the N-Queens Problem using various backtrack search strategies. Among the empirical results obtained are the following: 1) To find the first solution to the N-Queens Problem using lexicographic backtracking requires a time that grows exponentially with increasing values of N. 2) For most even values of N e 30, search time can be reduced by a factor from 2 to 70 by searching lexicographically for a solution to the N + 1Queens… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
45 Citations
6 References
Similar Papers

References

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

An Analysis of Backtracking with Search Rearrangement,

  • P. W. Purdom, Jr., C. A. Brown
  • SIAM J. Comput
  • 1983

Stone and Paolo Sipala , “ The Average Complexity of Depth - First Search with Backtracking and Cutoff

  • S Harold
  • IBM J . Res . Develop .

Similar Papers

Loading similar papers…