Fred

Fred is a methuselah with a lifespan of 35426 generations, discovered by Schneelocke on May 15, 2010, using Nathaniel Johnston's soup search script,[1][2] only the second pattern ever to be found this way with a longevity greater than that of Lidka, and the first with a lifespan greater than that of Edna. It was the longest-lived known methuselah to fit within a 20×20 bounding box until the discovery of Wilma.

Fred
<html><div class="rle"><div class="codebox"><div style="display:none;"><code></html>x = 20, y = 20, rule = B3/S23 5bo8bo2b2o$bo5b6o2bobo$3b6ob2o2bobo$o2bo2b2obo3bo4b2o$obob3o2bobo6bo$b ob4o2b3o5b2o$bo2b3ob2obob3o$o2bo4bo3bo6bo$b2o2b3o3bo3bo$obo3b2obo3bo2b obo$bo6bobo5b2o$6o2b3o2bo$2bo4b3o5bobo$2b2ob2o5bo3b3o$3bo2b4obobo2bob 2o$o4bo6b2obobo$o2bo2b2obobo$bo5bo2bo2bobobo$b3ob2obo$ob3obo6bo3b2o! #C [[ THUMBSIZE 2 THEME 6 GRID GRIDMAJOR 0 SUPPRESS THUMBLAUNCH ]] <nowiki></nowiki> <html></code></div></div><canvas width="200" height="300" style="margin-left:1px;"><noscript></html> <html></noscript></canvas></div></html>
View static image
Pattern type Methuselah
Number of cells 150
Bounding box 20×20
MCPS 164
Lifespan 35426 generations
Final population 2924
L/I 236.2
F/I 19.5
F/L 0.083
L/MCPS 216
Discovered by Schneelocke
Year of discovery 2010

The pattern is named after Dr. Fred Edison from the "Maniac Mansion" computer game, whose wife was also called "Edna".

Stable pattern

The stable pattern that results from Fred (excluding 67 escaping gliders) has 2924 cells and consists of 209 blinkers (including 19 traffic lights), 199 blocks (including one bi-block and one blockade), 128 beehives (including five honey farms), 42 loaves, 39 boats, 11 ships, nine ponds, six tubs, four long boats, three ship-ties (including 1 fleet), one toad, one barge and one aircraft carrier.

  • Generation 35426 of Fred (excluding escaping gliders)
gollark: ```haskellappend Nil data = Node Nil Nil dataappend n@(Node prev next x) data = Node prev (Node n next data) x```
gollark: Would they? I mean, in rust you invoke borrow checker wrath, in C you invoke malloc wrath, in lots of other ones it would be magically GCed I guess.
gollark: `data Aeae a = Node Aeae Aeae a | Nil`
gollark: You can quite easily do a doubly linked list, but if you manipulate it wrong it might turn into a horrible graph.
gollark: SMH my head, just have an unboxed vector of Word8s and store all data in that?!

See also

References
  1. "Long-Lived Patterns in Conway's Life". Online Life-Like CA Soup Search. Retrieved on May 16, 2010. (archived from the original)
  2. Oscar Cunningham (May 15, 2010). Re: The Online Life-Like CA Soup Search (discussion thread) at the ConwayLife.com forums
This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.