Solving 8-Queens problem using GA & BT on Android.
-
Updated
Jul 9, 2016 - Java
Solving 8-Queens problem using GA & BT on Android.
In this repository i am going to keep some of the important notes and programs which are most useful while Coding.
Artificial Intelligence Course @fmi 2020/2021
Solutions to NP-complete problems: N-Queens and Knight's Tour.
Hill Climbing and Hill Climbing With Random Restart implemented in Java.
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
BIL441-Artificial Intelligence-Project 2 Implementation
Solving the N-Queens problem using a blind and informed (heuristic) search. (School Project - 2017)
Returns sets of coordinates where n queens on a n by n chess board can exist in harmony
A uni project where we implemented blind search as well as metaheuristics approches to solving the NQueens Problem.
Backtracking solution for the N-Queens problem.
Highly optimized Java / GPU solvers for the N-Queens Problem.
Add a description, image, and links to the nqueens topic page so that developers can more easily learn about it.
To associate your repository with the nqueens topic, visit your repo's landing page and select "manage topics."