/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.

Primary LanguageJupyter NotebookMIT LicenseMIT

Stargazers