Discussion
What is the weakness shared by iterative deepening A star and recursive best first search?
Answer: A
Both use linear memory and therefore forget almost everything, so a node may be regenerated many times over. Algorithms that use whatever memory is available, such as the bounded memory variants, sit between the extremes. Both are optimal with an admissible heuristic, both use far less memory than A star, and cycles are handled by ordinary means. The tension between remembering to avoid rework and forgetting to save memory is the organising theme of the whole family.
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