Discussion
What is backtracking search?
Answer: C
Generating successors one at a time, and modifying the state in place rather than copying it, reduces the memory to a single state description plus the path, which is the standard implementation for constraint satisfaction. Undoing actions is how the state is restored rather than the definition, abandoned paths are not stored, and it is not bidirectional. Reducing memory from the branching factor times depth to depth alone is a further saving on an already frugal algorithm.
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