OCA:HighLife
| HighLife | |
| View static image | |
| View animated image | |
| Rulestring | 23/36 B36/S23 |
|---|---|
| Character | Chaotic |
HighLife is a Life-like cellular automaton in which cells survive from one generation to the next if they have 2 or 3 neighbours, and are born if they have 3 or 6 neighbours. It was first considered in 1994 by Nathan Thompson and it is mainly of interest due to a simple replicator that it allows.
Because its rulestring is so similar to that of Conway's Game of Life, many simple patterns exhibit the same behavior in both rules; it's only when patterns get complex that their behavior differs.
Notable patterns
By far the most notable pattern in HighLife is the simple replicator, shown to the right.
Still lifes
Because the only difference between the HighLife rules and the standard Life rules is that there is another way for cells to be born (when they have exactly six alive neighbours), all still lifes in the HighLife rule are necessarily still lifes under Conway's rules as well. Also, very few still lifes under the standard Life rules have dead cells with six alive neighbours, so the list of still lifes for the two rules are almost identical for small cell counts. The smallest patterns that are still lifes in the standard Life rules but not in HighLife are ship (with 6 cells) and hat (with 9 cells).
| Size | Count | Image | Links |
|---|---|---|---|
| ≤3 | 0 | ||
| 4 | 2 | 
|
Download RLE: click here |
| 5 | 1 | 
|
Download RLE: click here |
| 6 | 4 | 
|
Download RLE: click here |
| 7 | 4 | 
|
Download RLE: click here |
| 8 | 9 | 
|
Download RLE: click here |
| 9 | 9 | 
|
Download RLE: click here |
| 10 | 25 | 
|
Download RLE: click here |
| 11 | 44 | 
|
Download RLE: click here |
| 12 | 111 | 
|
Download RLE: click here |