Hill Climbing Algorithm

Hill climbing is a mathematical optimization technique belonging to the family of local search methods. It is an iterative algorithm that starts from an arbitrary candidate solution, then repeatedly attempts to find a better solution by making a small, incremental change to the current one, accepting the change whenever it improves the objective function, and stopping once no further improvement can be found nearby. Because it only ever accepts locally improving moves, hill climbing readily gets stuck at a local optimum that is not the true best solution. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/