<?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: Ricochet Robot solver</title>
	<atom:link href="http://www.mikkosgameblog.com/2002/11/ricochet-robot-solver/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.mikkosgameblog.com/2002/11/ricochet-robot-solver/</link>
	<description>Mikko Saari on board games.</description>
	<lastBuildDate>Fri, 06 Jan 2012 14:14:26 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Anonymous</title>
		<link>http://www.mikkosgameblog.com/2002/11/ricochet-robot-solver/comment-page-1/#comment-1559</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Tue, 02 Oct 2007 13:59:55 +0000</pubDate>
		<guid isPermaLink="false">http://vintagemahjong.com/gb/?p=3246#comment-1559</guid>
		<description>You can download a ricochet robots solver here : &lt;a href=&quot;http://ricochetrobots.fr.st&quot; rel=&quot;nofollow&quot;&gt;http://ricochetrobots.fr.st&lt;/a&gt;
</description>
		<content:encoded><![CDATA[<p>You can download a ricochet robots solver here : <a href="http://ricochetrobots.fr.st" rel="nofollow">http://ricochetrobots.fr.st</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://www.mikkosgameblog.com/2002/11/ricochet-robot-solver/comment-page-1/#comment-1558</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Thu, 13 Sep 2007 21:44:50 +0000</pubDate>
		<guid isPermaLink="false">http://vintagemahjong.com/gb/?p=3246#comment-1558</guid>
		<description>You may not actually be running out of memory, but just overflowing the stack.  In that case you can revise your solution to use iteration instead of recursion.  Of course you *will* run out of memory eventually, but you should be able to go deeper than 5 levels by not using recursion.  Good luck and post a demo!
</description>
		<content:encoded><![CDATA[<p>You may not actually be running out of memory, but just overflowing the stack.  In that case you can revise your solution to use iteration instead of recursion.  Of course you *will* run out of memory eventually, but you should be able to go deeper than 5 levels by not using recursion.  Good luck and post a demo!</p>
]]></content:encoded>
	</item>
</channel>
</rss>

