Solving and GUI demonstration of traditional N-Queens Problem using Hill Climbing, Simulated Annealing, Local Beam Search, and Genetic Algorithm.
Placing N chess queens on an NxN chessboard so that no two queens threaten each other.
Solution for both N Queens Puzzle and Knight's Tour (with GUI)
Project focuses on optimised implementation of Backtracking and Forward Checking algorithms in order to find all solutions of the N Queens problem
A java solution to the Eight Queen(N Queen) problem
Resolving N queens problem with Backtracking Algorithm
Optimized algorithm to find all solutions for the N-Queens-Problem in Java
Emulator of the N-Queens problem
AI algorithms
A wide range of (basic) data structures, implemented in simple, readable Java.
A java program that solves the n-queens puzzle using Hill Climbing and Random Restart algorithm in Artificial Intelligence.
Solving the N-Queens problem using Local Beam and BFS
daily codes
A Java-based solution to the N-Queens problem using backtracking. Includes support for custom board sizes and prints all valid arrangements
Collection of practical codes for Savitribai Phule Pune University's Design and Analysis of Algorithms Laboratory (410246).
Java program built using the backtracking algorithmic technique to solve the N Queens problem.
AI mini projects
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."