1.Previous
3.Next

the node that is closest to the goal based solely on the heuristic function (h(n)), without considering the path cost so far. It is fast but does not guarantee an optimal solution.
* Hill Climbing: A local search algorithm that iteratively moves from the current state to a better neighboring state. It is simple to implement but can get stuck in local optima (suboptimal solutions that are better than their immediate neighbors but not the overall best). An objective function (like a gradient for

1.Previous
3.Next