Discussion
When does iterative deepening A star perform badly?
Answer: C
If step costs are real valued, almost every node has a distinct f and each iteration raises the threshold by a tiny amount, so the number of iterations approaches the number of nodes. Rounding thresholds or using recursive best first search are the usual responses. Consistency, branching factor and shallow goals do not cause the problem. An algorithm whose efficiency depends on the granularity of the cost function is one whose applicability must be checked against the problem's costs.
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