N-queen problem solved by hill climbing, hill climbing with random restart and simulated annealing. Analysed the mean runtime, number of success and faliure and mean steps to reach goal state state for each algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
woodsman1/N-Queens-Hill-Climbing
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
N-Queens problem solved using Hill Climbing AI Algorithms
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published