🛠️ Tools to solve constraint satisfaction problems
-
Updated
Jul 26, 2021 - TypeScript
🛠️ Tools to solve constraint satisfaction problems
Implementation of the N-Queens problem by using Simulated Annealing as a local search algorithm and Min Conflicts as the CSP (Constraint Satisfaction Problem) algorithm.
RLFA Problem AIMA Python
Solving the N-Queens Problem using a Genetic Algorithm in combination with Min-Conflicts and bitboards for better performance.
Add a description, image, and links to the min-conflicts topic page so that developers can more easily learn about it.
To associate your repository with the min-conflicts topic, visit your repo's landing page and select "manage topics."