All the files have been commented for your ease. Furthermore you may also add further comments if you may.
For further queries contact me at : chhxnshah@gmail.com
-
Notifications
You must be signed in to change notification settings - Fork 0
Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. Simulated annealing is a probabilistic technique for approximating the global optimum of a given function.
License
HxnDev/N-Queen-Problem-using-Hill-Climbing-and-Simulated-Annealing
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. Simulated annealing is a probabilistic technique for approximating the global optimum of a given function.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published