https://github.com/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.
https://github.com/hxndev/n-queen-problem-using-hill-climbing-and-simulated-annealing
algorithm code google-collab hill-climbing hill-climbing-search jupyter-notebook n-queens problem-solving pyhton simulated-annealing
Last synced: 27 days ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/hxndev/n-queen-problem-using-hill-climbing-and-simulated-annealing
- Owner: HxnDev
- License: mit
- Created: 2021-07-24T09:09:43.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2021-07-24T09:10:13.000Z (almost 4 years ago)
- Last Synced: 2023-03-04T18:38:11.009Z (about 2 years ago)
- Topics: algorithm, code, google-collab, hill-climbing, hill-climbing-search, jupyter-notebook, n-queens, problem-solving, pyhton, simulated-annealing
- Language: Jupyter Notebook
- Homepage:
- Size: 28.3 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0