Using genetic algorithm for solving N-Queens problem
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 larg...
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference paper |
| Published: |
2023
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1833349216378814464 |
|---|---|
| author | Turky A.M. Ahmad M.S. |
| author2 | 25825717300 |
| author_facet | 25825717300 Turky A.M. Ahmad M.S. |
| author_sort | Turky A.M. |
| building | UNITEN Library |
| collection | Institutional Repository |
| content_provider | Universiti Tenaga Nasional |
| content_source | UNITEN Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | 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. |
| format | Conference paper |
| id | my.uniten.dspace-30609 |
| institution | Universiti Tenaga Nasional |
| publishDate | 2023 |
| record_format | dspace |
| spelling | my.uniten.dspace-306092023-12-29T15:50:15Z Using genetic algorithm for solving N-Queens problem Turky A.M. Ahmad M.S. 25825717300 56036880900 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 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. Final 2023-12-29T07:50:14Z 2023-12-29T07:50:14Z 2010 Conference paper 10.1109/ITSIM.2010.5561604 2-s2.0-78049410677 https://www.scopus.com/inward/record.uri?eid=2-s2.0-78049410677&doi=10.1109%2fITSIM.2010.5561604&partnerID=40&md5=56542bc99e1b4b805b7c6eb9db6b5f4b https://irepository.uniten.edu.my/handle/123456789/30609 2 5561604 745 747 Scopus |
| spellingShingle | 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 Turky A.M. Ahmad M.S. Using genetic algorithm for solving N-Queens problem |
| title | Using genetic algorithm for solving N-Queens problem |
| title_full | Using genetic algorithm for solving N-Queens problem |
| title_fullStr | Using genetic algorithm for solving N-Queens problem |
| title_full_unstemmed | Using genetic algorithm for solving N-Queens problem |
| title_short | Using genetic algorithm for solving N-Queens problem |
| title_sort | using genetic algorithm for solving n-queens problem |
| topic | 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 |
| url_provider | http://dspace.uniten.edu.my/ |