Discussion
What is hill climbing?
Answer: C
Hill climbing examines the neighbours of the current state and moves to the best one, stopping when no neighbour is better. It is simple, uses constant memory and is trapped by local maxima, ridges and plateaux. Abstraction hierarchies, frontier ordering and depth increase describe other algorithms. The greedy local move is the simplest possible search rule, which makes its characteristic failures the clearest illustration of why more elaborate methods exist.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development