<?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: REPL to the rescue!</title>
	<atom:link href="http://www.hackinghat.com/index.php/lisp/repl-to-the-rescue/feed" rel="self" type="application/rss+xml" />
	<link>http://www.hackinghat.com/index.php/lisp/repl-to-the-rescue</link>
	<description></description>
	<lastBuildDate>Tue, 20 Jul 2010 09:51:44 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Steve Knight</title>
		<link>http://www.hackinghat.com/index.php/lisp/repl-to-the-rescue/comment-page-1#comment-24417</link>
		<dc:creator>Steve Knight</dc:creator>
		<pubDate>Tue, 06 Oct 2009 14:00:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackinghat.com/index.php/lisp/repl-to-the-rescue#comment-24417</guid>
		<description>Ha!  I would never have thought of that, simple now you mention it.

Thanks!

Steve</description>
		<content:encoded><![CDATA[<p>Ha!  I would never have thought of that, simple now you mention it.</p>
<p>Thanks!</p>
<p>Steve</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jie</title>
		<link>http://www.hackinghat.com/index.php/lisp/repl-to-the-rescue/comment-page-1#comment-24002</link>
		<dc:creator>Jie</dc:creator>
		<pubDate>Thu, 17 Sep 2009 18:05:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.hackinghat.com/index.php/lisp/repl-to-the-rescue#comment-24002</guid>
		<description>There is a counting solution to the bridge problem. It&#039;s equivalent to counting possible arrangements of 13 cards and 3 spacer markers separating hearts, diamonds, clubs, spades

ccc_ccccc_ccc_cc
3h 5d 3c 2s

so this is equivalent to choosing 3 items out of 16

16!/(3!13!) = 560</description>
		<content:encoded><![CDATA[<p>There is a counting solution to the bridge problem. It&#8217;s equivalent to counting possible arrangements of 13 cards and 3 spacer markers separating hearts, diamonds, clubs, spades</p>
<p>ccc_ccccc_ccc_cc<br />
3h 5d 3c 2s</p>
<p>so this is equivalent to choosing 3 items out of 16</p>
<p>16!/(3!13!) = 560</p>
]]></content:encoded>
	</item>
</channel>
</rss>
