Question
Download Solution PDFConsider 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?Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFConcept:
In hill climbing algorithm, at each point in the search path, a successor node that appears to lead most quickly to the top of the hill or goal is selected for exploration.
In this method of searching, the generate and test method is augmented by a heuristic foundation which measures the closeness of the current state to the goal state.
Explanation:
Problems in hill climbing are:
1) Local maximum: It is a state which is better than all of its neighbours but is not better than some other states which are farther away. Solution of this problem is backtracking.
2) Plateau: It is a flat area of search space in which a whole set of neighbouring states have the same value. On a plateau, it is not possible to determine the best direction in which to move.
3) Ridge: It is an area of search space which is higher than the surrounding areas and that itself has a slope.
Last updated on Jun 6, 2025
-> The UGC NET Exam Schedule 2025 for June has been released on its official website.
-> The UGC NET Application Correction Window 2025 is available from 14th May to 15th May 2025.
-> The UGC NET 2025 online application form submission closed on 12th May 2025.
-> The June 2025 Exam will be conducted from 21st June to 30th June 2025
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.