ai-nqueens and N-Queens

ai-nqueens
31
Emerging
N-Queens
27
Experimental
Maintenance 0/25
Adoption 6/25
Maturity 8/25
Community 17/25
Maintenance 0/25
Adoption 5/25
Maturity 8/25
Community 14/25
Stars: 15
Forks: 11
Downloads: —
Commits (30d): 0
Language: Python
License: —
Stars: 9
Forks: 3
Downloads: —
Commits (30d): 0
Language: Python
License: —
No License Stale 6m No Package No Dependents
No License Stale 6m No Package No Dependents

About ai-nqueens

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.

combinatorial-problem algorithm-study artificial-intelligence local-search-algorithms computer-science-education

About N-Queens

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.

combinatorial-puzzles algorithm-exploration AI-education search-algorithms

Scores updated daily from GitHub, PyPI, and npm data. How scores work