rosarioscavo/N-Queens
This project was presented for the Artificial Intelligence course for the academic year 2022/2023. It explores various methods to solve the N-Queens problem, including Random Search, Backtracking, Hill-Climbing, Simulated Annealing, and Genetic Algorithms. Each method is evaluated for its efficiency and effectiveness in finding solutions.
No commits in the last 6 months.
Stars
—
Forks
—
Language
Jupyter Notebook
License
MIT
Category
Last pushed
May 28, 2024
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/rosarioscavo/N-Queens"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
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
AhmedNasserabdelkareem/N-Queens
Python Implementation for N-Queen problem using Hill Climbing, Genetic Algorithm, K-Beam Local...
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...