In this paper, we introduce Kangaroo, a constraint-based local search system. While existing systems such as Comet maintain invariants after every move, Kangaroo adopts a lazy strategy, updating invariants only when they are needed. Our empirical evaluation shows that Kangaroo consistently has a smaller memory footprint than Comet, and is usually significantly faster.

Presented at Conferences

  • 17th International Conference on Principles and Practice of Constraint Programming (CP2011) (2011)

    Perugia, Italy