Discussion
What advantage does the constraint formulation have over general search?
Answer: B
Because the state is described by variables, an algorithm can detect that a partial assignment already violates a constraint and discard every completion of it at once, which an atomic representation cannot express. The space is the same size, search is still required and the problems remain NP hard in general. Recognising that the gain comes from the representation rather than from any cleverness in the algorithm connects this topic directly to the earlier discussion of state representations.
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