profile-img
Eduncle posted an MCQ
February 22, 2020 • 17:24 pm 0 points
  • UGC NET
  • Computer Science & Applications

Consider the following : 

(a)    Trapping at local maxima
(b)    Reaching a plateau
(c)    Traversal along the ridge. 
Which of the following option represents shortcomings of the hill climbing algorithm?

Choose Your Answer:
0 Attempts Submit Now
  • 0 Likes
  • 1 Comments
  • 0 Shares
  • comment-profile-img>
    Eduncle Best Answer

    Hill climbing cannot reach the optimal/best state (global maximum) if it enters any of the following regions :
    1.    Local maximum : At a local maximum all neighboring states have a values which is worse than the current state. Since hill-climbing uses a greedy approach, it will not move to the           worse state and terminate itself. The process will end even though a better solution may exist.
           To overcome local maximum problem : Utilize backtracking technique. Maintain a list of visited states. If the search reaches an undesirable state, it can backtrack to the previous           configuration and explore a new path.
    2.    Plateau : On plateau all neighbors have same value. Hence, it is not possible to select the best direction.
           To overcome plateaus : Make a big jump. Randomly select a state far away from the current state. Chances are that we will land at a non-plateau region
    3.    Ridge : Any point on a ridge can look like peak because movement in all possible directions is downward. Hence the algorithm stops when it reaches this state.
           To overcome Ridge : In this kind of obstacle, use two or more rules before testing. It implies moving in several directions at once.

whatsapp-btn

Do You Want Better RANK in Your Exam?

Start Your Preparations with Eduncle’s FREE Study Material

  • Updated Syllabus, Paper Pattern & Full Exam Details
  • Sample Theory of Most Important Topic
  • Model Test Paper with Detailed Solutions
  • Last 5 Years Question Papers & Answers