/Simulated-Annealing-Min-Conflicts_N_Queens

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.

Primary LanguagePython

Watchers