Discussion
Why does A star graph search need consistency rather than mere admissibility?
Answer: C
With an explored set, once a state has been expanded it is never reconsidered, so if a cheaper route to it is found later the optimal solution can be missed unless consistency guarantees the first expansion was already cheapest. Reopening closed nodes is the alternative repair. Computability, storage and expansion order are not the issue. A guarantee that holds for one variant of an algorithm and not another is exactly the kind of detail that determines correctness in practice.
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