A complete solution to the maximum density still life problem

DOI10.1016/J.ARTINT.2012.02.001zbMath1251.68197DBLPjournals/ai/ChuS12OpenAlexW2000461262WikidataQ29544229 ScholiaQ29544229MaRDI QIDQ1761276

Geoffrey Chu, Peter J. Stuckey

Publication date: 15 November 2012

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2012.02.001

zbMATH Keywords

dynamic programmingcombinatorial optimizationsearchconstraint programming

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46)

Related Items (3)

Designing Game of Life mosaics with integer programming ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Unnamed Item

Uses Software

• MiniZinc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Constraint programming and hybrid formulations for three life designs
• Propagation via lazy clause generation
• Caching Search States in Permutation Problems
• Integer Programming and Conway's Game of Life

This page was built for publication: A complete solution to the maximum density still life problem