The N-queens problem and genetic algorithms
Abdollah Homaifar, Jon S. Turner, Shahzad Ali · 1992
The authors determined how well the operators of genetic algorithms handled very difficult combinatorial and constraint satisfaction problems. The N-queens problem is a complex combinatorial problem. Genetic algorithms are efficient and robust search algorithms that can solve the N-queens problem. To derive a problem, the genetic algorithm treats the problem as an ordering or sequencing problem and blindly traverses the search space to satisfy the large number of constraints posed by the inherent complexity of the problem. Results are presented for N>