A hill climbing algorithm that never makes “down hill” moves towards states with lower value (highest cost) is guaranteed to be incomplete, because it can get stuck on a local maximum. In contrast, a purely random walk i.e. moving to a successor chosen uniformly at random from the set of …