n-Cell Thick Patterns (3)
It is time for a list of the patterns that have maximum final noninfinite population for each minimal bounding box.
1 x 39
![]()
Pattern (RLE)
#CXRLE Pos=0,0 x = 39, y = 1, rule = B3/S23 3o7b4ob5ob4o2b4o2b6o!
It runs for 13617 generations and produces the following:

Final population: 3866 cells (including, thirty-eight gliders).
2 x 12

Pattern (RLE)
#CXRLE Pos=0,0 x = 12, y = 2, rule = B3/S23 4b3o3b2o$4o2bob4o!
It runs for 8854 generations and produces the following:

Final population: 2194/2202/2218 cells [note the pulsar] (including, thirty-nine gliders).
3 x 9

Pattern (RLE)
#CXRLE Pos=0,0 x = 9, y = 3, rule = B3/S23 o2b2ob3o$2o3bo2bo$4ob4o!
It runs for 14121 generations and produces the following:

Final population: 2660/2663 cells (including, forty-one gliders and a spaceship).
4 x 7

Pattern (RLE)
#CXRLE Pos=0,0 x = 7, y = 4, rule = B3/S23 bob2obo$2o2b2o$ob2o$2o2bobo!
It runs for 14988 generations and produces the following:

Final population: 2697/2695 cells (including, forty-six gliders).
5 x 5
There are two patterns:

Pattern #1 (RLE)
#CXRLE Pos=0,0 x = 5, y = 5, rule = B3/S23 o2b2o$obobo$ob3o$o3bo$ob3o!

Pattern #2 (RLE)
#CXRLE Pos=0,0 x = 5, y = 5, rule = B3/S23 o2b2o$obobo$2ob2o$o3bo$ob3o!
They run for 6582 generations and produce the following:

Final population: 1990 cells (including, thirty-three gliders).