<?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 for LAMBDAPHONE</title>
	<atom:link href="http://coder.bsimmons.name/blog/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://coder.bsimmons.name/blog</link>
	<description>a Haskell programming blog</description>
	<lastBuildDate>Sun, 07 Mar 2010 02:37:09 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on 17&#215;17: Brute Force Algorithm for an Optimal Rectangle-Free Subset by Thoughts on the 17 x 17 Challenge &#124; LAMBDAPHONE</title>
		<link>http://coder.bsimmons.name/blog/2010/02/17x17-brute-force-algorithm-for-an-optimal-rectangle-free-subset/comment-page-1/#comment-224</link>
		<dc:creator>Thoughts on the 17 x 17 Challenge &#124; LAMBDAPHONE</dc:creator>
		<pubDate>Sun, 07 Mar 2010 02:37:09 +0000</pubDate>
		<guid isPermaLink="false">http://coder.bsimmons.name/blog/?p=333#comment-224</guid>
		<description>[...] Here are the grids I was able to generate via brute force: [...]</description>
		<content:encoded><![CDATA[<div style="color: #E8E8E8;</p>
<p>blockquote {<br />
        margin: 2em;<br />
        padding: .1em 1.5em;<br />
        position: relative;<br />
        background: #2F2F2F;<br />
}<br />
">
<p>[...] Here are the grids I was able to generate via brute force: [...]</p>
</div>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on 17&#215;17: Deterministic algorithm for single-coloring a grid by 17&#215;17: Some Thoughts on the Problem &#124; LAMBDAPHONE</title>
		<link>http://coder.bsimmons.name/blog/2010/03/17x17-deterministic-algorithm-for-single-coloring-a-grid/comment-page-1/#comment-223</link>
		<dc:creator>17&#215;17: Some Thoughts on the Problem &#124; LAMBDAPHONE</dc:creator>
		<pubDate>Sun, 07 Mar 2010 02:33:02 +0000</pubDate>
		<guid isPermaLink="false">http://coder.bsimmons.name/blog/?p=337#comment-223</guid>
		<description>[...] until you hit a colored cell, then rotate 90 degrees  This led to a simple algorithm that does well in finding pretty good subsets, but doesn&#8217;t find optimal subsets for the [...]</description>
		<content:encoded><![CDATA[<div style="color: #E8E8E8;</p>
<p>blockquote {<br />
        margin: 2em;<br />
        padding: .1em 1.5em;<br />
        position: relative;<br />
        background: #2F2F2F;<br />
}<br />
">
<p>[...] until you hit a colored cell, then rotate 90 degrees  This led to a simple algorithm that does well in finding pretty good subsets, but doesn&#8217;t find optimal subsets for the [...]</p>
</div>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Cracking a Lock in Haskell with the De Bruijn sequence, pt. 2 by The "Prefer Opposite" algorithm in Haskell &#124; LAMBDAPHONE</title>
		<link>http://coder.bsimmons.name/blog/2009/09/cracking-a-lock-in-haskell-with-the-de-bruijn-sequence-pt-2/comment-page-1/#comment-207</link>
		<dc:creator>The "Prefer Opposite" algorithm in Haskell &#124; LAMBDAPHONE</dc:creator>
		<pubDate>Tue, 16 Feb 2010 00:22:44 +0000</pubDate>
		<guid isPermaLink="false">http://coder.bsimmons.name/blog/?p=221#comment-207</guid>
		<description>[...] an interesting investigation into a possible parallel algorithm. The first two posts are here and here.  [...]</description>
		<content:encoded><![CDATA[<div style="color: #E8E8E8;</p>
<p>blockquote {<br />
        margin: 2em;<br />
        padding: .1em 1.5em;<br />
        position: relative;<br />
        background: #2F2F2F;<br />
}<br />
">
<p>[...] an interesting investigation into a possible parallel algorithm. The first two posts are here and here.  [...]</p>
</div>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on An alternative definition for Data.List.groupBy by The Definition of Data.List.group &#124; LAMBDAPHONE</title>
		<link>http://coder.bsimmons.name/blog/2010/02/an-alternative-definition-for-datalistgroupby/comment-page-1/#comment-205</link>
		<dc:creator>The Definition of Data.List.group &#124; LAMBDAPHONE</dc:creator>
		<pubDate>Thu, 11 Feb 2010 04:43:17 +0000</pubDate>
		<guid isPermaLink="false">http://coder.bsimmons.name/blog/?p=318#comment-205</guid>
		<description>[...] EDIT: see also an alternative definition for Data.List.groupBy [...]</description>
		<content:encoded><![CDATA[<div style="color: #E8E8E8;</p>
<p>blockquote {<br />
        margin: 2em;<br />
        padding: .1em 1.5em;<br />
        position: relative;<br />
        background: #2F2F2F;<br />
}<br />
">
<p>[...] EDIT: see also an alternative definition for Data.List.groupBy [...]</p>
</div>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on An alternative definition for Data.List.groupBy by jberryman</title>
		<link>http://coder.bsimmons.name/blog/2010/02/an-alternative-definition-for-datalistgroupby/comment-page-1/#comment-204</link>
		<dc:creator>jberryman</dc:creator>
		<pubDate>Thu, 11 Feb 2010 04:41:25 +0000</pubDate>
		<guid isPermaLink="false">http://coder.bsimmons.name/blog/?p=318#comment-204</guid>
		<description>Yusaku, thanks for commenting and pointing out the error! I think that was a bad copy and paste job. Fixed now.</description>
		<content:encoded><![CDATA[<p>Yusaku, thanks for commenting and pointing out the error! I think that was a bad copy and paste job. Fixed now.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
