The N-queens problem and genetic algorithms
- 1 January 1992
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 262-267 vol.1
- https://doi.org/10.1109/secon.1992.202348
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- A polynomial time algorithm for the N-Queens problemACM SIGART Bulletin, 1990
- Representation selection for constraint satisfaction: a case study using n-queensIEEE Expert, 1990
- Efficient search techniques—An empirical study of the N-Queens ProblemIBM Journal of Research and Development, 1987
- The average complexity of depth-first search with backtracking and cutoffIBM Journal of Research and Development, 1986