Hill Climbing and Hill Climbing With Random Restart implemented in Java.
-
Updated
Mar 7, 2019 - Java
Hill Climbing and Hill Climbing With Random Restart implemented in Java.
Optimized algorithm to find all solutions for the N-Queens-Problem in Java
Algorithmic Puzzles android app
N Queens Problem - Explanation & Implementation
Solving 8-Queens problem using GA & BT on Android.
A uni project where we implemented blind search as well as metaheuristics approches to solving the NQueens Problem.
Advanced Data and Algorithms - 4th Semester
This project is a simulation of a well known constraint satisfaction problem. It solves it in sudoku and n-queens games.
Genetic optimization implemented in Java.
Java Implementaion of some Backtracking Porblems
Solution of the n-Queens-Problem
Interactive Sudoku Solver Visualizer showcasing backtracking algorithm implementation with real-time visualization on a Java Swing GUI.
My algorithm for the solution of the N-Queens problem using concurrency
BIL441-Artificial Intelligence-Project 2 Implementation
A Java implementation of solving the N-Queens problem using various search algorithms, including BFS, DFS, A* with different heuristics, genetic algorithm, and particle swarm optimization PSO. The project utilizes Java and JavaFX for the user interface.
Solving N-Queen problem using Genetic Algorithm
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
Add a description, image, and links to the nqueens-problem topic page so that developers can more easily learn about it.
To associate your repository with the nqueens-problem topic, visit your repo's landing page and select "manage topics."