Discussion
When is breadth first search optimal?
Answer: C
Breadth first finds the shallowest goal, which is the cheapest only if cost increases with depth, that is when all actions cost the same. With varying costs a deeper path may be cheaper and uniform cost search is needed instead. Branching factor and repeated states affect efficiency rather than optimality. A guarantee that holds only under a condition must always be stated with it, and this condition is the one most often forgotten.
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