Distributing Constraints by Sampling in Non-Binary CSPs
Miguel Á. Salido, Adriana Giret, Federico Barber · 2003
In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. Many Constraint Satisfaction Problems (CSPs) are solved using search algorithms, which require an order in which variables and values should be considered.