Question

Difference between best first search and hill climbing

Answer 1

So unlike BFS, the 'value' of the parent node is also taken into account. ... In simple hill climbing, the first closer node is chosen, whereas in steepest ascent hill climbing all successors are compared and the closest to the solution is chosen.