<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Longest-Lived Soup Density in Conway&#8217;s Game of Life</title>
	<atom:link href="http://www.nathanieljohnston.com/index.php/2009/06/longest-lived-soup-density-in-conways-game-of-life/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.nathanieljohnston.com/index.php/2009/06/longest-lived-soup-density-in-conways-game-of-life/</link>
	<description>A blog of recreational math and coding</description>
	<lastBuildDate>Sat, 31 Jul 2010 00:05:34 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Nathaniel Johnston &#187; The Maximal Lifespan of Patterns in Conway&#8217;s Game of Life</title>
		<link>http://www.nathanieljohnston.com/index.php/2009/06/longest-lived-soup-density-in-conways-game-of-life/comment-page-1/#comment-921</link>
		<dc:creator>Nathaniel Johnston &#187; The Maximal Lifespan of Patterns in Conway&#8217;s Game of Life</dc:creator>
		<pubDate>Fri, 31 Jul 2009 12:29:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.nathanieljohnston.com/?p=418#comment-921</guid>
		<description>[...] a couple of recent posts, I argued that random patterns in Conway&#8217;s Game of Life tend, on average, to [...]</description>
		<content:encoded><![CDATA[<p>[...] a couple of recent posts, I argued that random patterns in Conway&#8217;s Game of Life tend, on average, to [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nathaniel Johnston &#187; Longevity in Conway&#8217;s Game of Life Revisited</title>
		<link>http://www.nathanieljohnston.com/index.php/2009/06/longest-lived-soup-density-in-conways-game-of-life/comment-page-1/#comment-613</link>
		<dc:creator>Nathaniel Johnston &#187; Longevity in Conway&#8217;s Game of Life Revisited</dc:creator>
		<pubDate>Fri, 17 Jul 2009 12:01:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.nathanieljohnston.com/?p=418#comment-613</guid>
		<description>[...] couple of weeks ago, I posted some intuition that suggested that, in Conway&#8217;s Game of Life, the longest-lived patterns [...]</description>
		<content:encoded><![CDATA[<p>[...] couple of weeks ago, I posted some intuition that suggested that, in Conway&#8217;s Game of Life, the longest-lived patterns [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nathaniel Johnston &#187; The Online Life-Like CA Soup Search</title>
		<link>http://www.nathanieljohnston.com/index.php/2009/06/longest-lived-soup-density-in-conways-game-of-life/comment-page-1/#comment-551</link>
		<dc:creator>Nathaniel Johnston &#187; The Online Life-Like CA Soup Search</dc:creator>
		<pubDate>Sat, 11 Jul 2009 18:34:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.nathanieljohnston.com/?p=418#comment-551</guid>
		<description>[...] I mentioned in this post, one way to learn about the general behaviour of Conway&#8217;s Game of Life (or any other [...]</description>
		<content:encoded><![CDATA[<p>[...] I mentioned in this post, one way to learn about the general behaviour of Conway&#8217;s Game of Life (or any other [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nathaniel</title>
		<link>http://www.nathanieljohnston.com/index.php/2009/06/longest-lived-soup-density-in-conways-game-of-life/comment-page-1/#comment-471</link>
		<dc:creator>Nathaniel</dc:creator>
		<pubDate>Sun, 28 Jun 2009 16:11:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.nathanieljohnston.com/?p=418#comment-471</guid>
		<description>&lt;a href=&quot;#comment-465&quot; rel=&quot;nofollow&quot;&gt;@Elithrion&lt;/a&gt; - Haha yeah, I actually had already written the script and started the computations when you made the suggestion. Great minds think alike, I guess ;)

You make a good point about the median vs. mean thing - I&#039;ll definitely create median data if/when I post the results of the toroidal version of this script.

And I completely meant to attach the source code to this post (as I try to do with all my coding posts), but I forgot and it unfortunately is sitting on a harddrive halfway around the world right now. I&#039;ll update the post to include the source code in two weeks time ;)

Also, just as an FYI in case you&#039;re curious - I tried something semi-similar to what you described about trying to create methuselahs based on observing past long-lived patterns and evolving the density used. Instead I tried things like taking the top half of one methuselah (possibly modified by one or two cells) and the bottom half of another methuselah (also possibly mutated a bit) and checked whether that was long-lived. It was basically a standard cross-breed and mutate genetic algorithm, but unfortunately it yielded results that were no better than a uniformly random search, due to the high volatility of methuselahs. Silly Life.</description>
		<content:encoded><![CDATA[<p><a href="#comment-465" rel="nofollow">@Elithrion</a> &#8211; Haha yeah, I actually had already written the script and started the computations when you made the suggestion. Great minds think alike, I guess <img src='http://www.nathanieljohnston.com/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </p>
<p>You make a good point about the median vs. mean thing &#8211; I&#8217;ll definitely create median data if/when I post the results of the toroidal version of this script.</p>
<p>And I completely meant to attach the source code to this post (as I try to do with all my coding posts), but I forgot and it unfortunately is sitting on a harddrive halfway around the world right now. I&#8217;ll update the post to include the source code in two weeks time <img src='http://www.nathanieljohnston.com/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </p>
<p>Also, just as an FYI in case you&#8217;re curious &#8211; I tried something semi-similar to what you described about trying to create methuselahs based on observing past long-lived patterns and evolving the density used. Instead I tried things like taking the top half of one methuselah (possibly modified by one or two cells) and the bottom half of another methuselah (also possibly mutated a bit) and checked whether that was long-lived. It was basically a standard cross-breed and mutate genetic algorithm, but unfortunately it yielded results that were no better than a uniformly random search, due to the high volatility of methuselahs. Silly Life.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Elithrion</title>
		<link>http://www.nathanieljohnston.com/index.php/2009/06/longest-lived-soup-density-in-conways-game-of-life/comment-page-1/#comment-468</link>
		<dc:creator>Elithrion</dc:creator>
		<pubDate>Sun, 28 Jun 2009 04:11:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.nathanieljohnston.com/?p=418#comment-468</guid>
		<description>Actually, (apologies for the double-post) could you send me the source for this? I&#039;m curious to tweak it a little - I want to see if I can make it vary probabilities cell-by-cell and either come up with a more efficient generation mechanism this way (I imagine that having a few clumps separated by some white space will yield higher maximums than a uniform distribution, for example), or see if I can tweak it to evolve towards methuselahs (by having it continuously adjust the probabilities towards whatever gets the best results). Admittedly the latter option is unlikely due to high sensitivity of the generations to the exact starting conditions, but it would be awesome if it worked (and the former option could work if it doesn&#039;t) :D</description>
		<content:encoded><![CDATA[<p>Actually, (apologies for the double-post) could you send me the source for this? I&#8217;m curious to tweak it a little &#8211; I want to see if I can make it vary probabilities cell-by-cell and either come up with a more efficient generation mechanism this way (I imagine that having a few clumps separated by some white space will yield higher maximums than a uniform distribution, for example), or see if I can tweak it to evolve towards methuselahs (by having it continuously adjust the probabilities towards whatever gets the best results). Admittedly the latter option is unlikely due to high sensitivity of the generations to the exact starting conditions, but it would be awesome if it worked (and the former option could work if it doesn&#8217;t) <img src='http://www.nathanieljohnston.com/wp-includes/images/smilies/icon_biggrin.gif' alt=':D' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Elithrion</title>
		<link>http://www.nathanieljohnston.com/index.php/2009/06/longest-lived-soup-density-in-conways-game-of-life/comment-page-1/#comment-465</link>
		<dc:creator>Elithrion</dc:creator>
		<pubDate>Sun, 28 Jun 2009 01:06:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.nathanieljohnston.com/?p=418#comment-465</guid>
		<description>Ah, you sort of took my request! Although I think more extensive data would be nice - median density seems like it might be a bit more representative than average, and maximum density would be nice to have for the actual search (although that might need checks for outliers). Of course, it&#039;s not unlikely that the graphs for those would just mirror the average one, but then again there&#039;s a decent chance they would not (in particular, I expect that they would differ with regards to the 90% hump at least), and that would be interesting too.</description>
		<content:encoded><![CDATA[<p>Ah, you sort of took my request! Although I think more extensive data would be nice &#8211; median density seems like it might be a bit more representative than average, and maximum density would be nice to have for the actual search (although that might need checks for outliers). Of course, it&#8217;s not unlikely that the graphs for those would just mirror the average one, but then again there&#8217;s a decent chance they would not (in particular, I expect that they would differ with regards to the 90% hump at least), and that would be interesting too.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
