Discussion
What is iterative deepening search?
Answer: B
Running depth limited search with a limit of zero, then one, then two and so on gives the completeness and optimality of breadth first with the linear memory of depth first. The repeated work is much smaller than it appears. It is the standard choice when the space is large and the solution depth unknown. Combining the guarantees of one algorithm with the memory profile of another, at modest cost, is an unusually clean result.
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