Efficient search techniques—an empirical study of the N-Queens problem
IBM Journal of Research and Development
Algorithmics: theory & practice
Algorithmics: theory & practice
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Almost all k-colorable graphs are easy to color
Journal of Algorithms
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Divide and conquer under global constraints: a solution to the N-queens problem
Journal of Parallel and Distributed Computing
Learning hierarchies of abstraction spaces
Proceedings of the sixth international workshop on Machine learning
New methods to color the vertices of a graph
Communications of the ACM
Backtrack programming techniques
Communications of the ACM
A Computer Model of Skill Acquisition
A Computer Model of Skill Acquisition
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Constraint satisfaction with delayed evaluation
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
A planning/scheduling methodology for the constrained resource problem
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Control Abstractions for Local Search
Constraints
A connectionist framework for reasoning: reasoning with examples
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Learning cluster-based structure to solve constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Neural networks to guide the selection of heuristics within constraint satisfaction problems
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
New decision rules for exact search in N-Queens
Journal of Global Optimization
Learning vector quantization for variable ordering in constraint satisfaction problems
Pattern Recognition Letters
Hi-index | 0.00 |
This paper describes a simple heuristic method for solving large-scale constraint satisfaction and scheduling problems. Given an initial assignment for the variables in a problem, the method operates by searching though the space of possible repairs. The search is guided by an ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. We demonstrate empirically that the method performs orders of magnitude better than traditional backtracking techniques on certain standard problems. For example, the one million queens problem can be solved rapidly using our approach. We also describe practical scheduling applications where the method has been successfully applied. A theoretical analysis is presented to explain why the method works so well on certain types of problems and to predict when it is likely to be most effective.