---
title: "Look-Ahead Value Ordering for Constraint Satisfaction Problems"
authors:
  - "Daniel Frost"
  - "Rina Dechter"
doi: ""
url: "https://ijcai.org/proceedings/1995/75"
pdf: "https://ijcai.org/proceedings/1995/0075.pdf"
venue: "Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence"
year: 1995
pages: "572-577"
track: "Constraint Satisfaction"
keywords:
---

# Look-Ahead Value Ordering for Constraint Satisfaction Problems

Daniel Frost, Rina Dechter

*Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence*, pages 572-577.

## Abstract

Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another benefit of lo?king ahead is a useful domain value ordermg heuristic, which we call look-ahead value ordering or LVO. LVO counts the number of times each value of the current variable conflicts with some value of a future variable, and the value with the lowest number of conflicts is chosen first. Our experiments show that look-ahead value ordering can be of substantial benefit, especially on hard constraint satisfaction problems.