This is a n-queen problem solver using local search algorithms.
codes of my IUT course
8-Queens puzzle implementation with Hill Climbing(Random Restart) Algorithm
Solving some AI Problems
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.
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."