<?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: Gnomes puzzle</title>
	<atom:link href="http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/</link>
	<description>Thoughts, opinions and fascinating discoveries by Elliot, a student at USC</description>
	<pubDate>Sun, 06 Jul 2008 17:47:52 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: ucle</title>
		<link>http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-5390</link>
		<dc:creator>ucle</dc:creator>
		<pubDate>Fri, 08 Apr 2005 16:50:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-5390</guid>
		<description>&lt;strong&gt;bipakuoeu&lt;/strong&gt;

wpsdjeqlnrr</description>
		<content:encoded><![CDATA[<p><strong>bipakuoeu</strong></p>
<p>wpsdjeqlnrr</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Elliot Lee</title>
		<link>http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-187</link>
		<dc:creator>Elliot Lee</dc:creator>
		<pubDate>Sun, 10 Oct 2004 01:47:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-187</guid>
		<description>Here's the actual answer.

Since each gnome can see all the hats in front of him and hear all the 
answers in back of him, here's what he does. If the number of black 
hats in front of him plus the number of times a gnome in back of him 
said "black" is even, then he says "white". If the number is odd, he says "black."  
In other words, the rearmost gnome reports the parity of the hats in 
front of him, and each subsequent gnome compares the parity report 
from behind him to the parity he sees in front of him - a sneaky way 
to both use the information and pass it forward.  

To prove that 9 gnomes are safe, consider just the front 9 hats. 
The rearmost gnome reports the parity of the number of black hats. 
The next gnome compares the parity of the 8 hat sequence in front of 
him with the parity the last gnome reported. If the parities are the 
same, he says "White", because he knows that that's the only way the 
parities could be the same and if the parities are different he says 
"Black" - in both cases, he both saves his life, and provides the next 
gnome forward with an update of the parity to use for the 7th case, 
and so on.</description>
		<content:encoded><![CDATA[<p>Here&#8217;s the actual answer.</p>
<p>Since each gnome can see all the hats in front of him and hear all the<br />
answers in back of him, here&#8217;s what he does. If the number of black<br />
hats in front of him plus the number of times a gnome in back of him<br />
said &#8220;black&#8221; is even, then he says &#8220;white&#8221;. If the number is odd, he says &#8220;black.&#8221;<br />
In other words, the rearmost gnome reports the parity of the hats in<br />
front of him, and each subsequent gnome compares the parity report<br />
from behind him to the parity he sees in front of him - a sneaky way<br />
to both use the information and pass it forward.  </p>
<p>To prove that 9 gnomes are safe, consider just the front 9 hats.<br />
The rearmost gnome reports the parity of the number of black hats.<br />
The next gnome compares the parity of the 8 hat sequence in front of<br />
him with the parity the last gnome reported. If the parities are the<br />
same, he says &#8220;White&#8221;, because he knows that that&#8217;s the only way the<br />
parities could be the same and if the parities are different he says<br />
&#8220;Black&#8221; - in both cases, he both saves his life, and provides the next<br />
gnome forward with an update of the parity to use for the 7th case,<br />
and so on.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Choyak Yakatak</title>
		<link>http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-186</link>
		<dc:creator>Choyak Yakatak</dc:creator>
		<pubDate>Sat, 09 Oct 2004 23:24:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-186</guid>
		<description>The answer seems to be invalid in that it assumes there are 5 white and 5 black hats.  In the puzzle it is stated that the amount of black/white could not be equal, so there could be 9 black and 1 white etc.</description>
		<content:encoded><![CDATA[<p>The answer seems to be invalid in that it assumes there are 5 white and 5 black hats.  In the puzzle it is stated that the amount of black/white could not be equal, so there could be 9 black and 1 white etc.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Elliot Lee</title>
		<link>http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-146</link>
		<dc:creator>Elliot Lee</dc:creator>
		<pubDate>Sun, 26 Sep 2004 01:06:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-146</guid>
		<description>That's what I thought of too. Unfortunately, I cheated and read the answer on how to guarantee the lives of 9 gnomes (can you figure it out?)... but it's still a great puzzle.</description>
		<content:encoded><![CDATA[<p>That&#8217;s what I thought of too. Unfortunately, I cheated and read the answer on how to guarantee the lives of 9 gnomes (can you figure it out?)&#8230; but it&#8217;s still a great puzzle.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nancy Tang</title>
		<link>http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-145</link>
		<dc:creator>Nancy Tang</dc:creator>
		<pubDate>Sat, 25 Sep 2004 10:09:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.intelliot.com/blog/archives/2004/09/08/gnomes-puzzle/#comment-145</guid>
		<description>Hi Elliot.  I couldn't post on your guestbook, so I was checking out your blog.  I like puzzles like this.  I think the solution is for the every other gnome to agree to answer with the color of the gnome before's hat color.  That means the 10th gnome would respond with the color of the hat worn by the 9th gnome.  That gives the 10th gnome a 50% chance of survival, but the 9th gnome, when it's his turn has a 100% accuracy. Gnome 8 answers with the color of the hat in front of him, giving him a 50% chance, but 7 has 100% accuracy, and so on up the line.  You are guaranteed to save 5 gnomes this way.</description>
		<content:encoded><![CDATA[<p>Hi Elliot.  I couldn&#8217;t post on your guestbook, so I was checking out your blog.  I like puzzles like this.  I think the solution is for the every other gnome to agree to answer with the color of the gnome before&#8217;s hat color.  That means the 10th gnome would respond with the color of the hat worn by the 9th gnome.  That gives the 10th gnome a 50% chance of survival, but the 9th gnome, when it&#8217;s his turn has a 100% accuracy. Gnome 8 answers with the color of the hat in front of him, giving him a 50% chance, but 7 has 100% accuracy, and so on up the line.  You are guaranteed to save 5 gnomes this way.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
