Maximum density stable patterns in variants of Conway's game of Life
Abstract
We use integer programming to find maximum density stable patterns in variants of Conway's game of Life, and we describe how to use the constraints of an integer programming formulation to construct upper bounds on the maximum density of infinite stable patterns.
Repository Citation
Bosch, Robert. 2000. "Maximum density stable patterns in variants of Conway's game of Life." Operations Research Letters 27(1): 7-11.
Publisher
Elsevier
Publication Date
8-1-2000
Publication Title
Operations Research Letters
Department
Mathematics
Document Type
Article
DOI
10.1016/S0167-6377(00)00016-X
Keywords
Integer programming, Game of life, Cellular automata
Language
English
Format
text
COinS
