ConwayLife.com

This is an example of what I'm talking about using non-expandable methods, how many cells can can be in 1 instant death?
(by expandable, I mean things like)

I'm afraid one would need a formal definition of "expandable" in order to answer you question.

look at this pattern does it anwers your question?

No.

codeholic wrote:No.

Heh. Yes, this looks like the kind of thing where an answer is within fairly easy reach, once the question is clear.

For example, one could probably do an exhaustive search of all binary patterns up to, say, 7x7 without the corners, with more than half of the cells ON... and add whatever other criteria you want -- maybe the patch of cells must be kingwise connected?

So you write a script to generate these from highest to lowest population and run each for one tick, until one of them vanishes. That's the highest population inside that bounding box, anyway.

But then how do you decide if it's using "non-expandable methods" or not? Can we prove that there won't be anything bigger than 7x7 that's still non-expandable, or no? Ideally a script could automatically throw out the expandable patterns and leave the good ones, but that will require a much more specific definition of the term.

towerator wrote:look at this pattern

Code: Select all

x = 28, y = 41, rule = B3/S23
24b2o$22b6o$20b6o$18b8o$16b12o$14b12o$12b16o$10b16o$8b18o$6b22o$4b22o$
2b26o$26o$2b8o2b4o3b3o2b2o$9ob2ob4ob3ob6o$2b7ob3ob3ob3ob4o$2b7ob3ob3ob
4o2b4o$9ob3ob3ob3ob4o$2b7ob2ob4ob3ob6o$2b8o2b4o3b2ob4o$22o2b4o$2b24o$
26o$2b6ob19o$8ob17o$2b6ob19o$2b6ob17o$26o$2b26o$2b6ob17o$24o$2b20o$20o
$2b16o$2b14o$14o$2b10o$10o$2b6o$2b4o$2b2o!

does it anwers your question?

For a second I thought that was a threat.

I mean that variations of this pattern will give a few octillon different instantdiers.
Your life is safe.

Try a Chinese character in block