Discussion
What is a solution to a search problem?
Answer: A
The answer wanted is the sequence of actions, since knowing the goal state without knowing how to reach it is usually useless, and that sequence is recovered by following parent pointers back from the goal node. The visited set is a by-product and the minimum cost is a property of an optimal solution rather than the solution. Being clear about what the algorithm is asked to return determines what bookkeeping the nodes must carry.
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