Horrendous brute-force solution to the n-Queens-Problem using backtracking, implemented in go.
-
Updated
Oct 27, 2020 - Go
Horrendous brute-force solution to the n-Queens-Problem using backtracking, implemented in go.
A collection of algorithms for backtracking, dynamic programming, branch and bound, and graphs
An N-Queens solver implemented using a genetic algorithm, providing efficient heuristic solution.
Sencillo algoritmo evolutivo que resuelve el problema de las n-reinas
solving n-queens problem using JavaScript
Solutions to placing N Queens on an NxN chessboard with no mutual attacks.
Solves n-Queens problem using a genetic algorithm.
Solving N-Queens problem by implementing Memetic Algorithm.
Solver for the N-Queens problem
Generic Constraint Satisfaction Problem Solver
Implementations of useful algorithms
Term 1 Lab 9 (Optional) by Luke Schoen for Udacity Artificial Intelligence Nanodegree (AIND)
Short 8 queens problem solution. Python
Graphical Implementation of N-Queen's Algorithm using Back Tracking
Add a description, image, and links to the n-queens topic page so that developers can more easily learn about it.
To associate your repository with the n-queens topic, visit your repo's landing page and select "manage topics."