Abstract
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 >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
