Solving and GUI demonstration of Eight-Queens Problem using Hill Climbing
-
Updated
May 21, 2018 - C#
Solving and GUI demonstration of Eight-Queens Problem using Hill Climbing
Implementation of the N-Queen problem solved using the A* algorithm in C#, providing efficient solutions for placing N queens on a chessboard without attacking each other.
A C# project solving the N-Queen problem using Genetic Algorithm and Simulated Annealing for efficient and optimal solutions.
Add a description, image, and links to the n-queens-problem topic page so that developers can more easily learn about it.
To associate your repository with the n-queens-problem topic, visit your repo's landing page and select "manage topics."