Discussion
What is the main difficulty in implementing bidirectional search?
Answer: B
Working backwards needs the predecessors of a state, which is easy in a symmetric puzzle and awkward or impossible when actions are not invertible or when the goal is described by a property rather than a specific state. Interleaving on one processor is routine, meeting is detected by intersecting the frontiers, and memory is dominated by the smaller exponents. A technique whose applicability depends on a structural property of the problem must be checked against that property first.
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