Minimal Forward Checking

  title={Minimal Forward Checking},
  author={Michael J. Dent and Robert E. Mercer},
Forward Checking (FC) is a highly regarded complete search algorithm used t o solve Constraint Satisfaction Problems. In this paper a lazy variant of FC called Minimal Forward Checking (MFC) is introduced. MFC is a natural marriage of incremental FC and Backchecking. Given a variable selection heuristic which does not depend on domain size MFC’s worst case… CONTINUE READING