vitorverasm/ai-nqueens
This is a n-queen problem solver using local search algorithms.
Implements three distinct local search strategies—Hill Climbing, Hill Climbing with random restart, and Simulated Annealing—each evaluated against a heuristic measuring queen-pair conflicts. The CLI tool accepts configurable board size and iteration counts, comparing success rates and runtimes across all algorithms in a single run. Board solutions are visualized as ASCII grids with detailed performance metrics for empirical algorithm comparison.
No commits in the last 6 months.
Stars
15
Forks
11
Language
Python
License
—
Category
Last pushed
Feb 26, 2018
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/vitorverasm/ai-nqueens"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Related frameworks
SameetAsadullah/N-Queen-Problem-Using-Simulated-Annealing
N-Queen(s) Problem implemented using Simulated Annealing Algorithm in Python Language
AhmedNasserabdelkareem/N-Queens
Python Implementation for N-Queen problem using Hill Climbing, Genetic Algorithm, K-Beam Local...
briannamcdonald/baby-lizards-problem-GA
A Genetic Algorithm to solve the Baby Lizards Problem, which is a twist on the classic N-Queens problem.
awahib480/8-Queens-Solver
A 8-Queens Solver that solves a common AI problem of placing 8 queens on a 8x8 board without any...
alfred100p/N-Queens-Problem-Solver
A C++ Implementation of a CSP to solve the N queens problem showing all possible arrangements...