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!
|
Be the first to leave a comment!