YounesBensafia/GenesisKnight
Can the knight visit every square on the chessboard exactly once?, This is where the genetic algorithm steps in: by evolving generations of possible tours, selecting the most promising ones, it gradually guides the knight toward the perfect journey one that covers every square exactly once
Stars
3
Forks
—
Language
Python
License
—
Category
Last pushed
Nov 16, 2025
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/YounesBensafia/GenesisKnight"
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...
briannamcdonald/baby-lizards-problem-GA
A Genetic Algorithm to solve the Baby Lizards Problem, which is a twist on the classic N-Queens problem.
awahib480/8-Queens-Solver
A 8-Queens Solver that solves a common AI problem of placing 8 queens on a 8x8 board without any...