*long*is the minimum-length infinite-growing

*n*-cell thick pattern for n=1, 2, 3, 4, 5? Paul Callahan's exhaustive search found the answers for

*n*= 1 (i.e. 1 x 39) and

*n*= 5 (i.e. 5 x 5) in 1997-1998. However, I am not sure if the results for n=2, 3, 4 have been published before.

I created a Perl script for Golly to find those patterns. Currently, I know the anwers for 2-cell thick patterns, and I have some preliminary results for 3-cell thick patterns.

http://infinitegrowth.wordpress.com/200 ... atterns-1/

TL;DR: there is only one 2-cell thick pattern that fits inside a 2 x 12 rectangle and produces a block-laying switch engine; there are at least two different 3-cell thick patterns that fit inside a 3 x 9 rectangle and produce a block-laying switch engine, and a glider-making switch engine, respectively.