Discussion
Why is greedy best first search not optimal?
Answer: C
By minimising only the estimated remaining cost, greedy search will happily follow an expensive route that appears to point at the goal, and no comparison of total costs is ever made. Adding the accumulated cost back gives A star and restores optimality with an admissible heuristic. Heuristic quality, expansion order and goal detection are separate matters. An algorithm optimising the wrong quantity cannot be repaired by improving how well it optimises it.
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