Publication: Using genetic algorithm for solving N-Queens problem
Date
2010
Authors
Turky A.M.
Ahmad M.S.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The N-Queens problem is a well-known NP-Hard problem. Optimal solutions to small N values can be found in reasonable time by classical search algorithms or linear programming. However, since the N-Queens problem is a constraint satisfaction problem (CSP), it will be very time consuming to solve larger N values with guaranteed optimality. In this paper, genetic algorithm was adopted to solve the N-Queens problem. Results show that this evolutionary approach is very efficient and able to produce good results compared with other approaches e.g. classical search algorithms or linear programming. � 2010 IEEE.
Description
Keywords
Constraint Satisfaction Problem (CSP) , Genetic algorithms , N-Queens problem , Computational complexity , Information technology , Learning algorithms , Optimization , Constraint Satisfaction Problems , Evolutionary approach , N value , N-queens problems , NP-HARD problem , Optimal solutions , Optimality , Search Algorithms , Genetic algorithms