GitHub / NekSfyris / 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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NekSfyris%2FSimulated-Annealing-Min-Conflicts_N_Queens
PURL: pkg:github/NekSfyris/Simulated-Annealing-Min-Conflicts_N_Queens
Stars: 2
Forks: 0
Open issues: 0
License: None
Language: Python
Size: 13 MB
Dependencies parsed at: Pending
Created at: almost 6 years ago
Updated at: over 3 years ago
Pushed at: almost 6 years ago
Last synced at: about 2 years ago
Topics: constraint-satisfaction-problem, min-conflicts, n-queens, nqueens-problem, python, simulated-annealing