AhmedNasserabdelkareem/N-Queens
Python Implementation for N-Queen problem using Hill Climbing, Genetic Algorithm, K-Beam Local search and CSP
This project helps solve the classic N-Queens puzzle, a challenge where you place N chess queens on an N×N board without any two queens attacking each other. You input the board size (N), and the project outputs a valid arrangement of queens. It's designed for anyone interested in exploring different artificial intelligence search and optimization algorithms to solve combinatorial problems.
No commits in the last 6 months.
Use this if you are a student or hobbyist studying AI algorithms and want to see how various techniques like Hill Climbing, Genetic Algorithms, or CSP perform on a well-known puzzle.
Not ideal if you are looking for a general-purpose chess engine or a tool to solve complex, real-world optimization problems beyond simple puzzles.
Stars
9
Forks
3
Language
Python
License
—
Category
Last pushed
Dec 03, 2019
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/AhmedNasserabdelkareem/N-Queens"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Compare
Higher-rated alternatives
vitorverasm/ai-nqueens
This is a n-queen problem solver using local search algorithms.
SameetAsadullah/N-Queen-Problem-Using-Simulated-Annealing
N-Queen(s) Problem implemented using Simulated Annealing Algorithm in Python Language
RezaGooner/N-Queens-Simulated-Annealing
Solve the N-Queens problem using Simulated Annealing! Includes a graphical interface to...
Luis3Fernando/N-Queens-Algorithm-Visual
A visual and interactive solution to the classic N-Queens problem. Dynamically places N queens...
awahib480/8-Queens-Solver
A 8-Queens Solver that solves a common AI problem of placing 8 queens on a 8x8 board without any...