# Unit cell

A **unit cell** is a subset (usually rectangular or square) of the Life plane that tiles over the plane, along with a fixed number of distinct patterns, with each tile assuming one of the patterns, such that it simulates a cellular automaton, possibly itself. A **unit Life cell** is a unit cell that simulates the Game of Life. To avoid single cells themselves being considered unit cells, the size of a unit cell must be greater than 1x1. It is also a restriction that only finite sized patterns are accepted as unit cells excluding infinite one-cell thick bars in HighLife for example, which simulates Rule 54; many amphichiral 1D elementary automata can be embedded in other rules via this method.

## Contents

## Simulating a 2D cellular automaton

The first unit Life cell was constructed by David Bell in 1996.^{[1]} It employs standard glider logic to determine whether or not a glider should be present. The two states differ by a single glider. In 2004, Jared Prince modified David Bell's unit Life cell to support two (and therefore multiple) layers of Life universes, coined "deep cell".^{[2]}

More recently the OTCA metapixel was constructed that simulates any Life-like cellular automaton.^{[3]} Designed to run quickly in HashLife, it has the advantage of having two states that are clearly distinct when zoomed out.

The P1 megacell is currently the largest unit cell. Like the OTCA metapixel, it has clearly visible states. It is capable of simulating any rule, including non-totalistic and asymmetric rules, that uses the standard eight-cell neighborhood. It also has unusual positioning, being a square with diagonal edges. This allows much of its information to be transmitted with gliders.

## Simulating a 1D cellular automaton

### Natural occurrences

Many replicators also act as a one-dimensional cellular automaton, for example the replicator in HighLife.

### Constructions

Complex one-dimensional cellular automata usually can be simulated via constructed unit cells. Purpose of this is basically the containing automaton inherits some useful properties of the embedded, which is usually not trivial to prove. Such properties are logic universality, Turing-completeness etc. It is known that many examples are constructed in order to simulate Rule 110 and allegedly Rule 30 in one case. One is constructed in CGoL by Jason Summers^{[4]} and later it was trivially shown using Golly that it is a polyglot (works in EightLife, too)

#### Selection of life-like rules with constructed W110 unit cells

- B3[8]/S23[8] polyglot: works in Life, EightLife, Pedestrian Life and HoneyLife
^{[5]} - Banks-I: proves logic universality using Cook's results, simplifying Banks' proofs from 1971
^{[6]} - B35/S236
^{[7]} - DryLife and 3 more
^{[8]}

## References

- ↑ Paul Callahan (March 1, 1996). "The Unit Life Cell".
- ↑ Jared Prince (September 27, 2004). "Game of Life Deep Cell".
- ↑ Brice Due (May 28, 2006). "How Does It Work?".
*OTCAmetapixel*. Retrieved on March 26, 2009. - ↑ Hienrich Koenig (December 21, 2005). "New spaceship velocity".
*Game of Life News*. Retrieved on March 29, 2018. - ↑ Peter Naszvadi. FWSS-less MWSS-track-only Rule-110 Unit Cell (discussion thread) at the ConwayLife.com forums
- ↑ Peter Naszvadi. Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums
- ↑ Peter Naszvadi. Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums
- ↑ Peter Naszvadi. Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums

## External links

- Unit cell at the Life Lexicon