N Queens Problem - Explanation & Implementation
-
Updated
Feb 29, 2020 - Java
N Queens Problem - Explanation & Implementation
My algorithm for the solution of the N-Queens problem using concurrency
Java implementation of a NQueens problem solver, this application gets a size of the NQueens problem to solve and returns how many solutions it found/are possible. Will be extended to returning a solution aswell as/instead of a number
A generic genetic algorithmes , with mutation, survival and mating selection. Easy to add new type of genes.
Find best state using Backtracking, Forward Checking, Genetic Algorithm "Artificial Intelligent"
All AI related problem solution from my course
Visualizer for solving the N-Queens problem using backtracking with real-time visualization on a dynamic chessboard grid.
Add a description, image, and links to the nqueens-problem-solver topic page so that developers can more easily learn about it.
To associate your repository with the nqueens-problem-solver topic, visit your repo's landing page and select "manage topics."