The use of restart techniques in solving Constraint Satisfaction Problems (CSPs) is considered of small importance for backtrack search algorithms. In this paper we propose to conduct a preliminary study on the impact of restarts in randomized backtrack search algorithms for solving CSPs. We show that the well-know n-queens problem has a heavy-tail distribution. We present empirical evidences that restarts can effectively improve the time to solve the n-queens problem. We implement a conflict-driven variable heuristic, and present empirical evidences that this heuristic effectively improve the time to solve the n-queens problem.
|Title of host publication||NONE|
|Publication status||Published - 1 Jan 2010|
|Event||International Conference on Principles and Practices of Constraint Programming - |
Duration: 1 Jan 2010 → …
|Conference||International Conference on Principles and Practices of Constraint Programming|
|Period||1/01/10 → …|