<?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: Navigate a Grid Using Combinations And Permutations</title>
	<atom:link href="http://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/feed/" rel="self" type="application/rss+xml" />
	<link>http://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/</link>
	<description>Learning shouldn&#039;t hurt. Let&#039;s share the insights that made difficult ideas click.</description>
	<lastBuildDate>Wed, 08 Sep 2010 10:32:31 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Kalid</title>
		<link>http://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-284735</link>
		<dc:creator>Kalid</dc:creator>
		<pubDate>Sun, 09 May 2010 06:36:33 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/?p=205#comment-284735</guid>
		<description>@Dud: Thanks! Yes, Pascal&#039;s Triangle is another cool way to see it.</description>
		<content:encoded><![CDATA[<p>@Dud: Thanks! Yes, Pascal&#8217;s Triangle is another cool way to see it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dud</title>
		<link>http://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-283533</link>
		<dc:creator>Dud</dc:creator>
		<pubDate>Thu, 06 May 2010 12:38:21 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/?p=205#comment-283533</guid>
		<description>Another solution is using Pascal&#039;s triangle (and by extension, the binomial theorem) If you consider the number of ways you can reach successive corners, Pascal&#039;s forms from the start up toward the finish.</description>
		<content:encoded><![CDATA[<p>Another solution is using Pascal&#8217;s triangle (and by extension, the binomial theorem) If you consider the number of ways you can reach successive corners, Pascal&#8217;s forms from the start up toward the finish.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matt</title>
		<link>http://betterexplained.com/articles/navigate-a-grid-using-combinations-and-permutations/#comment-270614</link>
		<dc:creator>Matt</dc:creator>
		<pubDate>Wed, 20 Jan 2010 03:32:50 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/?p=205#comment-270614</guid>
		<description>In the random walk problem, is the number of possible up/right steps really 2^10? If we randomly pick either &#039;up&#039; or &#039;right&#039; ten times, then we will get some paths that take us beyond the boundaries of the grid like 10 consecutive up movements or 10 consecutive right movements. Since these are impossible, shouldn&#039;t they be excluded from the denominator of the probability?</description>
		<content:encoded><![CDATA[<p>In the random walk problem, is the number of possible up/right steps really 2^10? If we randomly pick either &#8216;up&#8217; or &#8216;right&#8217; ten times, then we will get some paths that take us beyond the boundaries of the grid like 10 consecutive up movements or 10 consecutive right movements. Since these are impossible, shouldn&#8217;t they be excluded from the denominator of the probability?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Page Caching using disk (enhanced) (user agent is rejected)
Database Caching 7/12 queries in 0.010 seconds using disk

Served from: betterexplained.com @ 2010-09-09 04:54:02 -->