A Dual Graph Translation of a Problem in ‘Life’
Conway’s game of Life provides interesting problems in which modelling issues in constraint programming can be explored. The problem of finding a maximum density stable pattern (‘still-life’) is discussed. A formulation of this problem as a constraint satisfaction problem with 0-1 variables and non-binary constraints is compared with its dual graph translation into a binary CSP. The success of the dual translation is surprising, from previously-reported experience, since it has as many variables as the non-binary CSP and very large domains. An important factor is the identification of many redundant constraints: it is shown that these can safely be removed from a dual graph translation if arc consistency is maintained during search.
Unable to display preview. Download preview PDF.
- F. Bacchus and P. van Beek. On the Conversion Between Non-Binary and Binary Constraint Satisfaction Problems. In Proceedings AAAI’98, pages 311–318, 1998.Google Scholar
- C. Bessière and J.-C. Régin. Arc consistency for general constraint networks: preliminary results. In Proceedings IJCAI’97, volume 1, pages 398–404, 1997.Google Scholar
- R. Bosch and M. Trick. Constraint programming and hybrid formulations for three life designs. In N. Jussien and F. Laburthe, editors, Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’02), pages 77–91, 2002.Google Scholar
- I. P. Gent and B. M. Smith. Symmetry Breaking During Search in Constraint Programming. In W. Horn, editor, Proceedings ECAI’2000, pages 599–603, 2000.Google Scholar
- K. Stergiou and T. Walsh. Encodings of Non-Binary Constraint Satisfaction Problems. In Proceedings AAAI’99, pages 163–168, 1999.Google Scholar