Backtracking algorithms for constraint satisfaction problems

Abstract

Over the past twenty ve years many backtracking algorithms have been developed for constraint satisfaction problems This survey describes the basic backtrack search within the search space framework and then presents a number of improvements developed in the past two decades including look back methods such as backjumping constraint recording backmarking and look ahead methods such as forward checking and dy namic variable ordering

Cite this paper

@inproceedings{Dechter1998BacktrackingAF, title={Backtracking algorithms for constraint satisfaction problems}, author={Rina Dechter and Daniel Frost}, year={1998} }