Abstract
The Maximum Density Sill-Life Problem is to fill an n ×n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of Life. We reformulate the problem into one of minimising “wastage” rather than maximising the number of live cells. This reformulation allows us to compute strong upper bounds on the number of live cells. By combining this reformulation with several relaxation techniques, as well as exploiting symmetries via caching, we are able to find close to optimal solutions up to size n = 100, and optimal solutions for instances as large as n = 69. The best previous method could only find optimal solutions up to n = 20.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bosch, R.: Integer programming and conway’s game of life. SIAM Review 41(3), 596–604 (1999)
Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. In: Proceedings of the International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CP-AI-OR 2002, pp. 77–91 (2002)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Elkies, N.: The still-life density problem and its generalizations. arXiv:math/9905194v1
Elkies, N.: The still-life density problem and its generalizations. Voronoi’s Impact on Modern Science: Book I, 228–253 (1998), arXiv:math/9905194v1
Larrosa, J., Dechter, R.: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems. Constraints 8(3), 303–326 (2003)
Larrosa, J., Morancho, E., Niso, D.: On the practical use of variable elimination in constraint optimization problems: ’still-life’ as a case study. Journal of Artificial Intelligence Research (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chu, G., Stuckey, P.J., de la Banda, M.G. (2009). Using Relaxations in Maximum Density Still Life. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)