Cannot recover from failure: Hill-climbing strategies expand the current state of the search and evaluate its children. The best child is selected for further expansion; neither its siblings nor its parent are retained. Because it keeps no history, the algorithm cannot recover from failures of its strategy.