Min-conflicts
Also known as Min-conflicts heuristic. This is the canonical page; those names redirect here.
Pairings in the atlas
- Conflict-count repairstandardLocal-search CSPbacktracking-cp
Rivals: other methods for the same problems
- AC-2001 arc consistency
- AC-4 arc consistency
- And-or search
- Backmarking
- Backtracking search
- Bound propagation
- Bounds consistency
- Bucket elimination
- Conflict-directed backjumping
- Depth-bounded discrepancy search
- Dynamic backtracking
- Forward checking
- Generalized arc consistency
- Graph-based backjumping
- Iterative broadening
- Limited discrepancy search
- Maintaining arc consistency
- Nogood learning
- Path consistency
- Regin's algorithm
- Restart with nogoods