HxnDev / N-Queen-Problem-using-Hill-Climbing-and-Simulated-Annealing

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.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

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

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.

License:MIT License


Languages

Language:Jupyter Notebook 100.0%