<?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: How to Find a Mathematician&#8217;s Hat Colour</title>
	<atom:link href="http://leedsmathgeeks.com/2009/how-to-find-a-mathematicians-hat-colour/feed/" rel="self" type="application/rss+xml" />
	<link>http://leedsmathgeeks.com/2009/how-to-find-a-mathematicians-hat-colour/</link>
	<description>Math is exciting... math is fun!</description>
	<lastBuildDate>Mon, 09 Jan 2012 12:02:55 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Vlad</title>
		<link>http://leedsmathgeeks.com/2009/how-to-find-a-mathematicians-hat-colour/comment-page-1/#comment-3903</link>
		<dc:creator>Vlad</dc:creator>
		<pubDate>Tue, 11 Jan 2011 20:15:50 +0000</pubDate>
		<guid isPermaLink="false">http://leedsmathgeeks.com/?p=122#comment-3903</guid>
		<description>Well, it&#039;s a year and a half later and I just realised I made a really silly mistake when considering the many-person version.

Don&#039;t worry, the 3-person version stands as it is. But with any higher number of people, they can just agree in advance that all except three will pass, then ignore those extra people, essentially reducing the problem back to the 3-person version.

(Credit goes to John above, who realised this tidbit in September 2009.)</description>
		<content:encoded><![CDATA[<p>Well, it&#8217;s a year and a half later and I just realised I made a really silly mistake when considering the many-person version.</p>
<p>Don&#8217;t worry, the 3-person version stands as it is. But with any higher number of people, they can just agree in advance that all except three will pass, then ignore those extra people, essentially reducing the problem back to the 3-person version.</p>
<p>(Credit goes to John above, who realised this tidbit in September 2009.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Livvloooo</title>
		<link>http://leedsmathgeeks.com/2009/how-to-find-a-mathematicians-hat-colour/comment-page-1/#comment-468</link>
		<dc:creator>Livvloooo</dc:creator>
		<pubDate>Thu, 22 Oct 2009 22:05:54 +0000</pubDate>
		<guid isPermaLink="false">http://leedsmathgeeks.com/?p=122#comment-468</guid>
		<description>Nice.</description>
		<content:encoded><![CDATA[<p>Nice.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vlad</title>
		<link>http://leedsmathgeeks.com/2009/how-to-find-a-mathematicians-hat-colour/comment-page-1/#comment-280</link>
		<dc:creator>Vlad</dc:creator>
		<pubDate>Mon, 14 Sep 2009 20:03:43 +0000</pubDate>
		<guid isPermaLink="false">http://leedsmathgeeks.com/?p=122#comment-280</guid>
		<description>@John:

That&#039;s a pretty cool solution.

But the way the problem is set, they have to answer &lt;b&gt;simultaneously&lt;/b&gt;. So no waiting for the one guy to pass :)</description>
		<content:encoded><![CDATA[<p>@John:</p>
<p>That&#8217;s a pretty cool solution.</p>
<p>But the way the problem is set, they have to answer <b>simultaneously</b>. So no waiting for the one guy to pass <img src='http://leedsmathgeeks.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Halvorsen</title>
		<link>http://leedsmathgeeks.com/2009/how-to-find-a-mathematicians-hat-colour/comment-page-1/#comment-276</link>
		<dc:creator>John Halvorsen</dc:creator>
		<pubDate>Mon, 14 Sep 2009 13:05:53 +0000</pubDate>
		<guid isPermaLink="false">http://leedsmathgeeks.com/?p=122#comment-276</guid>
		<description>The solution is extremely simple.
No matter how many people are in the room, all but three pass.
Then at least two of them are guaranteed to have the same hat color - one person who sees the same color then passes.
The remaining two people then know they are wearing the same color hat and both say the color of the hat on the other&#039;s head.  They win 100% of the time.</description>
		<content:encoded><![CDATA[<p>The solution is extremely simple.<br />
No matter how many people are in the room, all but three pass.<br />
Then at least two of them are guaranteed to have the same hat color &#8211; one person who sees the same color then passes.<br />
The remaining two people then know they are wearing the same color hat and both say the color of the hat on the other&#8217;s head.  They win 100% of the time.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vlad</title>
		<link>http://leedsmathgeeks.com/2009/how-to-find-a-mathematicians-hat-colour/comment-page-1/#comment-61</link>
		<dc:creator>Vlad</dc:creator>
		<pubDate>Wed, 06 May 2009 17:25:35 +0000</pubDate>
		<guid isPermaLink="false">http://leedsmathgeeks.com/?p=122#comment-61</guid>
		<description>@shadowart:
Yes, that&#039;s allowed.</description>
		<content:encoded><![CDATA[<p>@shadowart:<br />
Yes, that&#8217;s allowed.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: shAdOwArt</title>
		<link>http://leedsmathgeeks.com/2009/how-to-find-a-mathematicians-hat-colour/comment-page-1/#comment-59</link>
		<dc:creator>shAdOwArt</dc:creator>
		<pubDate>Wed, 06 May 2009 16:03:44 +0000</pubDate>
		<guid isPermaLink="false">http://leedsmathgeeks.com/?p=122#comment-59</guid>
		<description>Will the players recognize each other while playing the game? This is relevant to whether &quot;player X should look at the color of player Y&#039;s hat, and then guess&quot; strategies are allowed.</description>
		<content:encoded><![CDATA[<p>Will the players recognize each other while playing the game? This is relevant to whether &#8220;player X should look at the color of player Y&#8217;s hat, and then guess&#8221; strategies are allowed.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

