This is a n-queen problem solver using local search algorithms.
This code was submitted as programming project two for ITCS 6150 Intelligent Systems under Dr. Dewan Ahmad at the University of North Carolina at Charlotte for the fall 2021 semester. The aim is to solve N-Queens problem using hill climbing algorithm and its variants.
Solving some AI Problems
Tower Allocation Algorithm using heuristic search(BeamSearch)
Backing up codes I wrote, during my Artificial Intelligence course.
codes of my IUT course
A java program that solves the n-queens puzzle using Hill Climbing and Random Restart algorithm in Artificial Intelligence.
The implementation of the N-Queen Problem using two approaches - Random Restart Hill Climbing and Min-Conflicts
Term 1 Lab 8 (Optional) by Luke Schoen for Udacity Artificial Intelligence Nanodegree (AIND)
AI Project2 Fall 2018
NQueen problem solved using Simple Hill and Restart Climbing Heuristic Algorithm
Solving N-Queens problem using Hill Climbing approach
8-Queens puzzle implementation with Hill Climbing(Random Restart) Algorithm
Optimization course assignments
Hill Climbing and Hill Climbing With Random Restart implemented in Java.
Add a description, image, and links to the random-restart topic page so that developers can more easily learn about it.
To associate your repository with the random-restart topic, visit your repo's landing page and select "manage topics."