selimfirat/ai-n-queens
Solving and GUI demonstration of traditional N-Queens Problem using Hill Climbing, Simulated Annealing, Local Beam Search, and Genetic Algorithm.
This tool helps visualize and solve the classic N-Queens problem, a type of combinatorial puzzle. You input the number of queens you want to place on a chessboard, and it uses different AI techniques to find arrangements where no two queens can attack each other. It's designed for students or enthusiasts learning about artificial intelligence algorithms and problem-solving.
No commits in the last 6 months.
Use this if you are studying or teaching artificial intelligence and want to see how algorithms like Hill Climbing or Genetic Algorithms solve a classic combinatorial puzzle.
Not ideal if you are looking for a practical chess tool or a general-purpose combinatorial optimization solver for real-world business problems.
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.
Related tools
arman324/Genetic-Algorithm-N-Queen
Solving N-queens problem with Genetic Algorithm - Artificial Intelligence
AidenHadisi/8Queens-vs-AI
Solves n-Queens problem using a genetic algorithm.
YounesBensafia/GenesisKnight
Can the knight visit every square on the chessboard exactly once?, This is where the genetic...
briannamcdonald/baby-lizards-problem-GA
A Genetic Algorithm to solve the Baby Lizards Problem, which is a twist on the classic N-Queens problem.
farkoo/N-Queen-Genetic-Algorithm
Solve the N-Queen problem using the genetic algorithm