<?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: 100 Monks</title>
	<atom:link href="http://quizzes-online.com/blog/2007/08/28/100-monks/feed/" rel="self" type="application/rss+xml" />
	<link>http://quizzes-online.com/blog/2007/08/28/100-monks/</link>
	<description>science, quizzes, games, and more!</description>
	<pubDate>Fri, 21 Nov 2008 00:56:14 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>By: Quiz Master</title>
		<link>http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-148</link>
		<dc:creator>Quiz Master</dc:creator>
		<pubDate>Wed, 24 Sep 2008 09:17:25 +0000</pubDate>
		<guid isPermaLink="false">http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-148</guid>
		<description>Laura --- the working principle is that you can determine the solution to the n-monk problem if you know the solution to the (n-1)-monk problem.

To see how this works, consider the case of three monks, Abelard, Bernard, and Charles (so n=3).  On the day of the announcement, each of A, B, and C sees two dotted monks.  Each monk immediately deduces that either there are two ill monks (in which case they themselves are safe), or there are three ill monks (in which case they are doomed to die).

If Charles, for instance, were actually in the two monk situation, then he knows Abelard and Bernard won't turn up for breakfast on the 2nd day.  If they are munching down their porridge on the 2nd day, then Charles realises that all three of them have the disease.  Abelard and Bernard apply the same logic, come to the same conclusion, and never make it for breakfast on the 3rd day.

This gives the solution to the 3-monk problem, from which you can deduce the solution to the 4-monk problem, and so on.

I hope this helps.  Please do ask if anything is unclear.</description>
		<content:encoded><![CDATA[<p>Laura &#8212; the working principle is that you can determine the solution to the n-monk problem if you know the solution to the (n-1)-monk problem.</p>
<p>To see how this works, consider the case of three monks, Abelard, Bernard, and Charles (so n=3).  On the day of the announcement, each of A, B, and C sees two dotted monks.  Each monk immediately deduces that either there are two ill monks (in which case they themselves are safe), or there are three ill monks (in which case they are doomed to die).</p>
<p>If Charles, for instance, were actually in the two monk situation, then he knows Abelard and Bernard won&#8217;t turn up for breakfast on the 2nd day.  If they are munching down their porridge on the 2nd day, then Charles realises that all three of them have the disease.  Abelard and Bernard apply the same logic, come to the same conclusion, and never make it for breakfast on the 3rd day.</p>
<p>This gives the solution to the 3-monk problem, from which you can deduce the solution to the 4-monk problem, and so on.</p>
<p>I hope this helps.  Please do ask if anything is unclear.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Laura</title>
		<link>http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-147</link>
		<dc:creator>Laura</dc:creator>
		<pubDate>Wed, 24 Sep 2008 01:45:05 +0000</pubDate>
		<guid isPermaLink="false">http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-147</guid>
		<description>Sorry, I'm a bit confused. Maybe someone can help. I can understand the example given if two monks are ill. Each knows that the doctor said 'at least one' would be ill, and they know that when a monk realises he is ill, he will die that night.

Right, I'm okay so far. But when we start to make the assumption that this will work in a kind of compound way... I get a bit lost. Why would 13 monks end up assuming that each of them, as individuals, were ill, just because the other 12 hadn't died yet? The realisation that you're ill doesn't tie in with a large number of others not having died yet... not beyond a pair of ill monks, does it? With a pair, there's the logic that each of them can see that no other monks have the red spot on their forehead, so they assume they must have it. But why would all 13 eventually reach the realisation that they have the red dot, on the same (13th) day? They might suspect they have it, but how can they be sure? 

Sorry, I can't quite grasp this. Can anyone help my soft squidgy brain, please?</description>
		<content:encoded><![CDATA[<p>Sorry, I&#8217;m a bit confused. Maybe someone can help. I can understand the example given if two monks are ill. Each knows that the doctor said &#8216;at least one&#8217; would be ill, and they know that when a monk realises he is ill, he will die that night.</p>
<p>Right, I&#8217;m okay so far. But when we start to make the assumption that this will work in a kind of compound way&#8230; I get a bit lost. Why would 13 monks end up assuming that each of them, as individuals, were ill, just because the other 12 hadn&#8217;t died yet? The realisation that you&#8217;re ill doesn&#8217;t tie in with a large number of others not having died yet&#8230; not beyond a pair of ill monks, does it? With a pair, there&#8217;s the logic that each of them can see that no other monks have the red spot on their forehead, so they assume they must have it. But why would all 13 eventually reach the realisation that they have the red dot, on the same (13th) day? They might suspect they have it, but how can they be sure? </p>
<p>Sorry, I can&#8217;t quite grasp this. Can anyone help my soft squidgy brain, please?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: punissuer</title>
		<link>http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-23</link>
		<dc:creator>punissuer</dc:creator>
		<pubDate>Wed, 04 Jun 2008 17:38:09 +0000</pubDate>
		<guid isPermaLink="false">http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-23</guid>
		<description>I see now you labelled a day with zero.  In common usage, the "first day" would be the day with no predecessors.  If by "n-th day", you mean the day with n predecessors, then I think you should say so in the puzzle, not just the hints.</description>
		<content:encoded><![CDATA[<p>I see now you labelled a day with zero.  In common usage, the &#8220;first day&#8221; would be the day with no predecessors.  If by &#8220;n-th day&#8221;, you mean the day with n predecessors, then I think you should say so in the puzzle, not just the hints.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: punissuer</title>
		<link>http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-22</link>
		<dc:creator>punissuer</dc:creator>
		<pubDate>Wed, 04 Jun 2008 17:31:50 +0000</pubDate>
		<guid isPermaLink="false">http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-22</guid>
		<description>Since the dead monks were discovered on the 13th morning, they would have died on the 12th night, so there should be only 12 dead monks.</description>
		<content:encoded><![CDATA[<p>Since the dead monks were discovered on the 13th morning, they would have died on the 12th night, so there should be only 12 dead monks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nickoli</title>
		<link>http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-21</link>
		<dc:creator>Nickoli</dc:creator>
		<pubDate>Wed, 10 Oct 2007 11:35:10 +0000</pubDate>
		<guid isPermaLink="false">http://quizzes-online.com/blog/2007/08/28/100-monks/#comment-21</guid>
		<description>12?</description>
		<content:encoded><![CDATA[<p>12?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
