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
Generate a logic problem. Model it as a binary constraint satisfaction problem (CSP). Choose a backtracking search algorithm. Watch the CSP get solved.
Solved N Queens Problem Using Heuristic Search (Simulated Annealing)
n-Queens [Completion] problem solver implemented as multithreaded randomized non-recursive backtracking algorithm with dam-pruning
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."