Hill Climbing is a mathematical optimization technique which belongs to the family or local search. It is an iterative algorithm which starts with arbitrary solution to a problem, which attempts to find a better solution by incrementally changing a single element of the solution.