This week's featured article

1×N quadratic growth is a pattern found by Stephen Silver on April 20 2011; it is the first pattern discovered that starts out with the thickness of a single cell and has quadratic growth. It uses the breeder from Nick Gotts' 26cell quadratic growth.
On November 6, 2014, Chris Cain completed a 14812×1 pattern that exhibits quadratic growth — and on November 10th he reduced this to 7242×1.

In the news


Pattern collection

The LifeWiki contains one of the most comprehensive catalogues of patterns available on the internet. Within it you will find:


Did you know...

 ... that Adam P. Goucher's distributed Catagolue soupsearch project, started in February 2015, has already tested more random soups than any previous such project, and has contributed to the reduction of many glider construction recipes?
 ... that any gliderconstructible Life pattern can be constructed with a fixed maximum number of gliders N, probably less than 1000? It is only necessary to construct a slidingblock decoder, which selfdestructs after converting the position of a fardistant block into a slowsalvo recipe that constructs the required pattern.
 ... that Copperhead is not only the first c/10 orthogonal spaceship ever found, but also remarkably compact for a pattern not discovered until 2016?
 ... that loafer is the fifth smallest nonflotilla spaceship, but was discovered 43 years after the four spaceships smaller than it?
 ... that despite being the fourth smallest nonflotilla orthogonal spaceship, loafer has never appeared from a single randomly generated soup?
 ... that all known glider eaters take at least four ticks to recover to their original state after eating a glider?
 ... that the smallest 31c/240 spaceship does not make use of the 31c/240 reaction?
 ... that there is roughly one chance in 10^(N/3) that a still life appearing out of random soup will have a population of exactly N cells?
 ... that the number of still lifes with N+1 bits is roughly 2.48 times larger than the number of Nbit still lifes?
 ... that the odds of a randomlychosen 20x20 soup pattern being a methuselah that lasts between 1000N and 1000(N+1) ticks, is roughly the same as the odds that it will last any amount of time longer than 1000x(N+1) ticks?

