There are 1 repository under random-restart topic.
This is a n-queen problem solver using local search algorithms.
codes of my IUT course
Hill Climbing and Hill Climbing With Random Restart implemented in Java.
8-Queens puzzle implementation with Hill Climbing(Random Restart) Algorithm
Solving some AI Problems
Tower Allocation Algorithm using heuristic search(BeamSearch)
NQueen problem solved using Simple Hill and Restart Climbing Heuristic Algorithm
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.
A java program that solves the n-queens puzzle using Hill Climbing and Random Restart algorithm in Artificial Intelligence.
Solving N-Queens problem using Hill Climbing approach
Backing up codes I wrote, during my Artificial Intelligence course.
Optimization course assignments
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