Skip to main content
SpringerLink
Log in

Applying Ad-hoc Global Constraints with the \({\tt case}\) Constraint to Still-Life

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

The Still-Life problem is challenging for CP techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this paper, we show how ad hoc global \({\tt case}\) constraints can be customized to construct various models to provide much stronger propagation with CP solvers. Since we use custom ad hoc constraints of high arity where the number of tuples to define the constraint are large, the actual constraint representation becomes important to avoid excessive space consumption. We demonstrate how to use BDDs to construct good representations for the \({\tt case}\) constraint which is critical for efficiency. Our results seem comparable to hybrid CP/IP models even though we are only using propagation albeit on ad hoc global constraints. This paper shows an extensive example of how to systematically build models using different kinds of ad hoc constraints. It also demonstrates the solving potential of ad hoc global constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beldiceanu, N. (2000). Global constraints as graph properties on structured networks of elementary constraints of the same type. TR T2000-01, SICS.

  2. Bessière, C., & Règin, J.-C. (1997). Arc consistency for general constraint networks: Preliminary results. In International Joint Conference on Artificial Intelligence (IJCAI), (pp. 398–404).

  3. Bosch, R., & Trick, M. (2004). Constraint programming and hybrid formulations for three Life designs. Annals of Operations Research, 130, 41–56.

    Article  MathSciNet  MATH  Google Scholar 

  4. Bryant, R. E. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35(8), 667–691.

    MathSciNet  Google Scholar 

  5. Carlsson, M., et al., (2005). SICStus Prolog User’s Manual. Swedish Institute of Computer Science, release 3.12.1 edition. ISBN 91-630-3648-7.

  6. Cheng, C. K., Lee, J. H. M., & Stuckey, P. J. (2003). Box constraint collections for ad-hoc constraints. In Principles and Practice of Constraint Programming (CP), (pp. 214–228).

  7. Clarke, E. M., Grumberg, O., & Peled, D. A. (1999). Model Checking. The MIT Press.

  8. Dao, T. B. H., Lallouet, A., Legtchenko, A., & Martin, L. (2002). Indexical-based solver learning. In Principles and Practice of Constraint Programming (CP), (pp. 541–555). (September).

  9. Gardner, M. (1970). The fantastic combinations of John Conway’s new solitaire game. Scientific American, 223, 120–123.

    Article  Google Scholar 

  10. Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In International Joint Conference on Artificial Intelligence (IJCAI).

  11. Larrosa, J., Morancho, E., & Niso, D. (2005). On the practical applicability of bucket elimination: Still-life as a case study. Journal of Artificial Intelligence Research, 23, 21–440.

    Google Scholar 

  12. Petrie, K. E., Smith, B. M., & Yorke-Smith, N. (2004). Dynamic symmetry breaking in constraint programming and linear programming hybrids. In European Starting AI Researcher Symp.

  13. Smith, B. M. (2002). A dual graph translation of a problem in ‘life’. In Principles and Practice of Constraint Programming (CP), (pp. 402–414).

  14. Smith, B. M., & Sturdy, P. (2005). Value ordering for finding all solutions. In International Joint Conference on Artificial Intelligence (IJCAI), (pp. 311–316).

Download references

Author information

Authors and Affiliations

  1. National University of Singapore, School of Computing, 3 Science Drive 2, Singapore, Singapore

    Kenil C. K. Cheng & Roland H. C. Yap

Authors
  1. Kenil C. K. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland H. C. Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roland H. C. Yap.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, K.C.K., Yap, R.H.C. Applying Ad-hoc Global Constraints with the \({\tt case}\) Constraint to Still-Life. Constraints 11, 91–114 (2006). https://doi.org/10.1007/s10601-006-8058-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-006-8058-9

Keywords

Search

Navigation