The variable ordering heuristic is an important module in algorithms dedicated to solve Constraint Satisfaction Problems (CSP), while it impacts the efficiency of exploring search space and size tree. It also exploits, often implicitly, structure instances. In this paper, we propose Conflict-History Search (CHS), a dynamic adaptive for CSP solving. based on failures considers temporality these ...