<?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"
	>
<channel>
	<title>Comments on: A square grid path problem</title>
	<atom:link href="http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/</link>
	<description>Programming, Algorithms, and Mathematics</description>
	<pubDate>Tue, 06 Jan 2009 15:30:37 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.1</generator>
		<item>
		<title>By: jff</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-1305</link>
		<dc:creator>jff</dc:creator>
		<pubDate>Thu, 16 Oct 2008 21:25:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-1305</guid>
		<description>Amanda,

just replace n by 8 in the first formula and you get the desired result :)</description>
		<content:encoded><![CDATA[<p>Amanda,</p>
<p>just replace n by 8 in the first formula and you get the desired result <img src='http://www.joaoff.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: amanda</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-1300</link>
		<dc:creator>amanda</dc:creator>
		<pubDate>Thu, 16 Oct 2008 00:13:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-1300</guid>
		<description>hey! 
how many solutions would be in a 8X8?
=D</description>
		<content:encoded><![CDATA[<p>hey!<br />
how many solutions would be in a 8X8?<br />
=D</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nektra Advanced Computing Blog :: Google Treasure Hunt puzzles are too easy?</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-894</link>
		<dc:creator>Nektra Advanced Computing Blog :: Google Treasure Hunt puzzles are too easy?</dc:creator>
		<pubDate>Fri, 23 May 2008 18:40:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-894</guid>
		<description>[...] gets solved just searching in Google for &#8220;grid path right down&#8221; from there you will get the equation that you must run on any language that has Big Integer implementations, since involves the [...]</description>
		<content:encoded><![CDATA[<p>[...] gets solved just searching in Google for &#8220;grid path right down&#8221; from there you will get the equation that you must run on any language that has Big Integer implementations, since involves the [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jff</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-893</link>
		<dc:creator>jff</dc:creator>
		<pubDate>Sun, 18 May 2008 01:06:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-893</guid>
		<description>Dr. Goulu: no problem! Good luck with Google's challenge.</description>
		<content:encoded><![CDATA[<p>Dr. Goulu: no problem! Good luck with Google&#8217;s challenge.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Recrutement et Casse-Tête &#171; Dr. Goulu</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-892</link>
		<dc:creator>Recrutement et Casse-Tête &#171; Dr. Goulu</dc:creator>
		<pubDate>Sat, 17 May 2008 22:06:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-892</guid>
		<description>[...] pour un damier de 56&#215;32 cases (le nombre change pour chaque participant) et dans ce cas, la réponse est 232059241971866600926656. Ca suppose donc déjà de disposer d&#8217;une bonne calculatrice [...]</description>
		<content:encoded><![CDATA[<p>[...] pour un damier de 56&#215;32 cases (le nombre change pour chaque participant) et dans ce cas, la réponse est 232059241971866600926656. Ca suppose donc déjà de disposer d&#8217;une bonne calculatrice [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dr. Goulu</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-891</link>
		<dc:creator>Dr. Goulu</dc:creator>
		<pubDate>Sat, 17 May 2008 21:09:24 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-891</guid>
		<description>useful for Google Treasure Hunt 2008 at http://treasurehunt.appspot.com/ ... Thanks ! ;-)</description>
		<content:encoded><![CDATA[<p>useful for Google Treasure Hunt 2008 at <a href="http://treasurehunt.appspot.com/" rel="nofollow">http://treasurehunt.appspot.com/</a> &#8230; Thanks ! <img src='http://www.joaoff.com/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jff</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-738</link>
		<dc:creator>jff</dc:creator>
		<pubDate>Wed, 13 Feb 2008 20:46:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-738</guid>
		<description>Boo2468: 70 ?</description>
		<content:encoded><![CDATA[<p>Boo2468: 70 ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Boo2468</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-733</link>
		<dc:creator>Boo2468</dc:creator>
		<pubDate>Wed, 13 Feb 2008 13:27:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-733</guid>
		<description>How many routes is there on a 4 by 4 grid?</description>
		<content:encoded><![CDATA[<p>How many routes is there on a 4 by 4 grid?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jff</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-651</link>
		<dc:creator>jff</dc:creator>
		<pubDate>Tue, 22 Jan 2008 23:38:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-651</guid>
		<description>As long as you define the factorial function correctly, it should be very easy. In Haskell, for instance, you can define it as:

fac 0 = 1
fac n = n * fac (n-1)

Good luck!</description>
		<content:encoded><![CDATA[<p>As long as you define the factorial function correctly, it should be very easy. In Haskell, for instance, you can define it as:</p>
<p>fac 0 = 1<br />
fac n = n * fac (n-1)</p>
<p>Good luck!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: fish613</title>
		<link>http://www.joaoff.com/2008/01/20/a-square-grid-path-problem/#comment-650</link>
		<dc:creator>fish613</dc:creator>
		<pubDate>Tue, 22 Jan 2008 22:44:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.joaoferreira.org/2008/01/20/a-square-grid-path-problem/#comment-650</guid>
		<description>You're very welcome :)
I'm currently trying to make my own solution work, also involving the binomial, but my program fails to give the right answer, even though I'm sure it's working properly :(</description>
		<content:encoded><![CDATA[<p>You&#8217;re very welcome <img src='http://www.joaoff.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /><br />
I&#8217;m currently trying to make my own solution work, also involving the binomial, but my program fails to give the right answer, even though I&#8217;m sure it&#8217;s working properly <img src='http://www.joaoff.com/wp-includes/images/smilies/icon_sad.gif' alt=':(' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
</channel>
</rss>
