Discussion
In which problem does the search tree greatly exceed the state space?
Answer: D
In a grid a state at distance d can be reached by very many routes, so the tree has exponentially many nodes over a merely quadratic state space. Where the space is already a tree the two coincide, and irreversible or single action problems produce no redundancy either. Recognising in advance whether a space contains many alternative routes decides whether graph search is essential or merely tidy.
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