>>10832893hill climbing don't know if reach global maximum.
Hill climbing is a random search algortihms if problem had huge number solutions can give you fast respond over pure brute force solutions.
https://www.seas.upenn.edu/~cis391/Lectures/informed-search-II.pdfSimulated annealing is the upgrade version use in a lot problems.
I remember implement few seconds thousands queens in chess board using Hill climbing with random restarts vs maybe 20-queens using recursive brute force.
