1-Cell Thick Patterns (2)

“What’s the smallest one cell high pattern to emit a glider?”

asks Macbi in a post at ConwayLife.com

I have modified my script in Perl for Golly, which explored all possible one-cell thick patterns, in order to provide a specific answer to the previous question.

It took five seconds to get the results…

My preliminary approach was to to detect escaping gliders

The shortest patterns that produce escaping gliders are the following two 15-bit patterns:

Pattern #1


Pattern (RLE)
#CXRLE Pos=0,0
x = 15, y = 1, rule = B3/S23

Initially, there are 13 alive cells. The pattern runs for 522 generations and produces this:


Final population: 150 cells (including four gliders).

Pattern #2

Pattern (RLE)
#CXRLE Pos=0,0
x = 15, y = 1, rule = B3/S23

Initially, there are 12 alive cells. As shown in the previous post, the pattern runs for 3183 generations and produces this:

Final population: 1059 cells (including six gliders).


One Response to “1-Cell Thick Patterns (2)”

  1. […] refer to 1-Cell Thick Patterns (2) for more information about this […]

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: