Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Turky A.M., Ahmad M.S.
Other Authors: 25825717300
Format: Conference paper
Published: 2023
Subjects:
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
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items