The “Hill Climbing Algorithm” is a mathematical optimization technique which belongs to the family of local search. It is used to solve certain types of problems where the goal is to maximize or minimize a given function. The algorithm works by starting at a random point and iteratively moving to the nearest higher value, similar to climbing up a hill until the peak is reached.
Hill Climbing Algorithm
Author:
Published:
Updated:
« Back to Glossary Index
Definition of “Hill Climbing Algorithm” :
« Back to Glossary Index
Affiliate Disclaimer
As an affiliate, we may earn a commission from qualifying purchases. We get commissions for purchases made through links on this website from Amazon and other third parties.