The Path repair algorithm

In this paper, we introduce a new solving algorithm for Constraint Satisfaction Problems the path-repair algorithm. The two main points of that algorithm are: it makes use of a repair algorithm (local search) as a basis and it works on a partial instantiation in order to be able to use filtering techniques. Different versions are presented and first experiments with both systematic and non systematic versions show promising results.