Hill Climbing

From Cohen Courses
Jump to navigationJump to search

Hill climbing is a generic optimization method that is used for finding maxima and minima of a certain objective function. . It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by incrementally changing a single element of the solution. In a simple hill climbing implementation the direction of steepest ascent is chosen and a point is then picked.