Discussion
Why can repeated states make tree search exponentially worse?
Answer: D
In a grid where each state has several routes to it, a tree search expands the same subtree once for every distinct path, turning a polynomial state space into an exponential search tree. The explored set collapses that to one expansion per state. Goal testing and cost remain correct, and termination fails only with genuine loops. The distinction between the size of a state space and the size of the tree over it is one of the most consequential in the subject.
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