vitorverasm/ai-nqueens
This is a n-queen problem solver using local search algorithms.
This project helps computer science students and enthusiasts solve the classic N-Queens puzzle, a well-known combinatorial problem in artificial intelligence. It takes the size of a chessboard (N) as input and outputs a valid arrangement of N queens where none can attack each other. It's designed for those exploring local search algorithms like Hill Climbing and Simulated Annealing.
No commits in the last 6 months.
Use this if you are studying or experimenting with AI search algorithms and need a concrete example to understand how local search, heuristics, and optimization work.
Not ideal if you're looking for a practical application beyond academic or theoretical exploration, as the N-Queens problem is primarily a learning tool for algorithm design.
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.
Compare
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...
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...