Discussion
What is recursive best first search?
Answer: D
RBFS explores depth first but remembers the f value of the best alternative path at each level, and unwinds when the current path exceeds it, replacing each node's f with the best value found beneath it. It uses linear memory and is optimal with an admissible heuristic, at the cost of regenerating nodes repeatedly. Implementation style, decomposition and restarting are different ideas. Carrying just enough information to know when to abandon a path is what makes linear memory possible.
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