selimfirat/ai-n-queens
Solving and GUI demonstration of traditional N-Queens Problem using Hill Climbing, Simulated Annealing, Local Beam Search, and Genetic Algorithm.
Implements configurable parameters for each algorithm—iteration limits, temperature decay for simulated annealing, beam width for local beam search, and mutation rates for genetic algorithms—enabling comparative analysis of convergence behavior. The architecture initializes from random board states and includes adaptive mechanisms like local maxima escape (hill climbing/beam search) and temperature-based move acceptance (simulated annealing). Built with a visual GUI that renders real-time board configurations and algorithm progress across all four search strategies.
No commits in the last 6 months.
Stars
42
Forks
10
Language
Java
License
—
Category
Last pushed
Jul 04, 2017
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/generative-ai/selimfirat/ai-n-queens"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.