Discussion
How is a constraint problem converted into a standard search problem?
Answer: A
The natural formulation makes a state a consistent partial assignment and an action the assignment of a value to an unassigned variable, with the goal being a complete consistent assignment. That gives a tree of depth equal to the number of variables. The last option describes the local search formulation, which is a different and equally valid choice. Two formulations of the same problem, suiting different algorithms, is common and choosing between them is part of the design.
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