Discussion
Why can constraint satisfaction algorithms outperform general search?
Answer: D
Because states are described by variables, an algorithm can detect that a partial assignment is already inconsistent and prune every completion of it at once, which an atomic representation cannot express. Heuristics such as most constrained variable are a further benefit of the same structure. The space is the same, and exact solutions are returned. The lesson that representation determines what can be exploited, established early in the subject, pays off concretely here.
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