Discussion
Why should depth limited search distinguish failure from cutoff?
Answer: B
If no node was truncated at the limit, the space below was fully explored and the absence of a solution is proved; if the limit was reached anywhere, the search is simply inconclusive and a deeper limit may succeed. Iterative deepening relies on that distinction to know when to stop. Memory, formulation errors and timeouts are unrelated. Returning enough information to distinguish two very different outcomes costs one boolean and saves considerable confusion.
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