Discussion
What is the min conflicts heuristic?
Answer: B
In local search over complete assignments, selecting a conflicted variable and giving it the value that minimises the number of violated constraints solves very large problems remarkably fast. A million queens is solved in seconds. Variable selection is usually random among conflicted ones, and the other options describe different quantities. A hill climbing rule on the count of violations turns a combinatorial search into an optimisation, with all the advantages and the local optimum risk that implies.
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