A graph search algorithm where the current path is extended with a successor node which is closer to the solution than the end of the current path.
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. Both forms fail if there is no closer node. This may happen if there are local maxima in the search space which are not solutions. Steepest ascent hill climbing is similar to best first search but the latter tries all possible extensions of the current path in order whereas steepest ascent only tries one.
Then presently we were climbing a hill—climbing by a narrow road, one that did not permit of turning around.
Hot weather, hill climbing, and the excitement of fighting combine to accentuate the desire to drink.
This worked very nicely for a time until it became dark and the hill climbing act began.
hill climbing, when there is no danger of overtaxing the heart, is even more effective than walking on a level.
Walking, running, and hill climbing are all excellent, but do not in themselves suffice to develop the chest to the utmost.