Discussion
Why is min conflicts so effective on the n queens problem?
Answer: C
For large n solutions are extremely numerous and almost any starting point is within a few repairs of one, so a greedy repair heuristic succeeds almost immediately. Problems with few solutions or rugged landscapes defeat it. Solutions are many rather than unique, the constraints are binary, and no decomposition exists. That an algorithm's success depends on the solution density of the instance, rather than on the problem class, explains why local search performs so unevenly.
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