Discussion
What is backtracking search in a constraint problem?
Answer: B
Backtracking chooses an unassigned variable, tries each value consistent with the assignment so far and recurses, returning when no value works. It is depth first search specialised to this representation, and its memory is linear. Backward search, restarts and recording failures describe other techniques, the last being no-good learning. A basic algorithm that is transformed by the heuristics layered on it is the pattern of this whole topic.
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