Discussion
What is iterative deepening A star?
Answer: B
IDA star performs a depth first search that prunes any node whose f exceeds a threshold, then raises the threshold to the smallest f that was pruned and repeats, giving A star's optimality with linear memory. Its weakness is repeating work when many distinct f values exist. Memory limits, successor ordering and bidirectionality describe other variants. Replacing a depth cutoff by a cost cutoff is a small change that transfers the whole iterative deepening argument to the informed setting.
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