Discovery - University of Dundee - Online Publications

Library & Learning Centre

Constraint programming to solve maximal density still life

Constraint programming to solve maximal density still life

Research output: Chapter in Book/Report/Conference proceedingChapter

View graph of relations

Authors

Research units

Info

Original languageEnglish
Title of host publicationGame of Life Cellular Automata
EditorsAndrew Adamatzky
Place of PublicationLondon
PublisherSpringer
Pages167-175
Number of pages9
ISBN (Electronic)9781849962179
ISBN (Print)9781849962162
DOIs
StatePublished - 2010

Abstract

The Maximum Density Still Life problem fills a finite Game of Life board with a stable pattern of cells that has as many live cells as possible. Although simple to state, this problem is computationally challenging for any but the smallest sizes of board. Especially difficult is to prove that the maximum number of live cells has been found. Various approaches have been employed. The most successful are approaches based on Constraint Programming (CP). We describe the Maximum Density Still Life problem, introduce the concept of constraint programming, give an overview on how the problem can be modelled and solved with CP, and report on best-known results for the problem. © 2010 Springer-Verlag London Limited.

Documents

DOI

Library & Learning Centre

Contact | Accessibility | Policy