The Hill-Climbing search algorithm can become stuck due to which of the following limitations?
The Hill-Climbing search algorithm can become stuck due to which of the following limitations?
Multiple Choice Options
- A
Local maxima
- B
Ridges
- C
Plateaux
- D✓ Correct Option
All of these
Detailed Technical Solution & Explanation
Simple hill climbing is an iterative local greedy search algorithm that continuously moves in the direction of increasing value (steepest ascent). However, it frequently fails to find the global optimum due to three classic topological obstacles in state-space landscapes:
1. Local Maxima: A peak higher than all surrounding neighboring states, but lower than the global maximum.
2. Ridges: A sequence of local maxima where the slope gently rises along an angle not aligned with the search operator axes, causing the algorithm to oscillate or terminate.
3. Plateaux (Flat Local Maxima / Shoulders): An area of the search space where the evaluation function is completely flat, providing no gradient direction to guide further moves.