<?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: Winning and losing at Nim</title>
	<atom:link href="http://joningram.org/blog/2008/08/winning-and-losing-at-nim/feed/" rel="self" type="application/rss+xml" />
	<link>http://joningram.org/blog/2008/08/winning-and-losing-at-nim/</link>
	<description>Maths, teaching and beyond.</description>
	<lastBuildDate>Thu, 11 Mar 2010 22:24:43 -0800</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Jan M. Rasmussen</title>
		<link>http://joningram.org/blog/2008/08/winning-and-losing-at-nim/comment-page-1/#comment-695</link>
		<dc:creator>Jan M. Rasmussen</dc:creator>
		<pubDate>Wed, 22 Apr 2009 06:54:54 +0000</pubDate>
		<guid isPermaLink="false">http://joningram.org/?p=52#comment-695</guid>
		<description>I have written about the theory of impartial games, and Nim in particular, on my blog, http://sputsoft.com/?p=58.</description>
		<content:encoded><![CDATA[<p>I have written about the theory of impartial games, and Nim in particular, on my blog, http://sputsoft.com/?p=58.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Maths: The Final Frontier &#187; Blog Archive &#187; More on Nim: The 123 game network</title>
		<link>http://joningram.org/blog/2008/08/winning-and-losing-at-nim/comment-page-1/#comment-599</link>
		<dc:creator>Maths: The Final Frontier &#187; Blog Archive &#187; More on Nim: The 123 game network</dc:creator>
		<pubDate>Fri, 20 Feb 2009 13:01:27 +0000</pubDate>
		<guid isPermaLink="false">http://joningram.org/?p=52#comment-599</guid>
		<description>[...] while back, I wrote an introduction to the game of Nim. If you can&#8217;t remember the rules, then go remind [...]</description>
		<content:encoded><![CDATA[<p>[...] while back, I wrote an introduction to the game of Nim. If you can&#8217;t remember the rules, then go remind [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: It&#8217;s the Thought that Counts &#187; Blog Archive &#187; Carnival of Mathematics #38</title>
		<link>http://joningram.org/blog/2008/08/winning-and-losing-at-nim/comment-page-1/#comment-46</link>
		<dc:creator>It&#8217;s the Thought that Counts &#187; Blog Archive &#187; Carnival of Mathematics #38</dc:creator>
		<pubDate>Tue, 12 Aug 2008 02:49:04 +0000</pubDate>
		<guid isPermaLink="false">http://joningram.org/?p=52#comment-46</guid>
		<description>[...] — you should go and check it out! Of particular interest to me was Jon Ingram&#8217;s post on winning and losing at Nim. Nim is a very simple game, but there are a lot of really interesting results associated with it, [...]</description>
		<content:encoded><![CDATA[<p>[...] — you should go and check it out! Of particular interest to me was Jon Ingram&#8217;s post on winning and losing at Nim. Nim is a very simple game, but there are a lot of really interesting results associated with it, [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jon Ingram</title>
		<link>http://joningram.org/blog/2008/08/winning-and-losing-at-nim/comment-page-1/#comment-35</link>
		<dc:creator>Jon Ingram</dc:creator>
		<pubDate>Wed, 06 Aug 2008 14:10:34 +0000</pubDate>
		<guid isPermaLink="false">http://joningram.org/?p=52#comment-35</guid>
		<description>I didn&#039;t want to give a complete course on combinatorial game theory in this post, I just wanted to show the pretty picture I made :).

But it&#039;s true that it&#039;s hard to find a simple explanation of why nim-addition is equivalent to finding the bitwise xor of two numbers... at least, hard to find an explanation which doesn&#039;t require a high level of mathematical maturity. I&#039;d love to find an explanation which is suitable for the average A-level student... but these days few students know about binary numbers and binary arithmetic, so that would have to introduced first. Oh for the days of New Math when all students knew about binary before percentages!</description>
		<content:encoded><![CDATA[<p>I didn&#8217;t want to give a complete course on combinatorial game theory in this post, I just wanted to show the pretty picture I made :).</p>
<p>But it&#8217;s true that it&#8217;s hard to find a simple explanation of why nim-addition is equivalent to finding the bitwise xor of two numbers&#8230; at least, hard to find an explanation which doesn&#8217;t require a high level of mathematical maturity. I&#8217;d love to find an explanation which is suitable for the average A-level student&#8230; but these days few students know about binary numbers and binary arithmetic, so that would have to introduced first. Oh for the days of New Math when all students knew about binary before percentages!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jack</title>
		<link>http://joningram.org/blog/2008/08/winning-and-losing-at-nim/comment-page-1/#comment-34</link>
		<dc:creator>Jack</dc:creator>
		<pubDate>Wed, 06 Aug 2008 13:53:54 +0000</pubDate>
		<guid isPermaLink="false">http://joningram.org/?p=52#comment-34</guid>
		<description>&quot;&lt;em&gt;Explaining &lt;strong&gt;why&lt;/strong&gt; this is true is quite difficult&lt;/em&gt;&quot;

Scribling in your margins, Jon?</description>
		<content:encoded><![CDATA[<p>&#8220;<em>Explaining <strong>why</strong> this is true is quite difficult</em>&#8221;</p>
<p>Scribling in your margins, Jon?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
