<?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: Hangin&#8217; With Howard Lederer</title>
	<atom:link href="http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/feed/" rel="self" type="application/rss+xml" />
	<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/</link>
	<description>Two Canadians Abroad</description>
	<lastBuildDate>Sat, 20 Mar 2010 13:51:26 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: Rob</title>
		<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/comment-page-1/#comment-159</link>
		<dc:creator>Rob</dc:creator>
		<pubDate>Tue, 02 Sep 2008 19:30:59 +0000</pubDate>
		<guid isPermaLink="false">http://minoragenda.com/?p=55#comment-159</guid>
		<description>Is there guaranteed to be at least 1 of each color?</description>
		<content:encoded><![CDATA[<p>Is there guaranteed to be at least 1 of each color?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rob</title>
		<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/comment-page-1/#comment-158</link>
		<dc:creator>Rob</dc:creator>
		<pubDate>Tue, 02 Sep 2008 19:30:31 +0000</pubDate>
		<guid isPermaLink="false">http://minoragenda.com/?p=55#comment-158</guid>
		<description>Darn you! I had it down to 99/100 otherwise on #1. 

*ponders*</description>
		<content:encoded><![CDATA[<p>Darn you! I had it down to 99/100 otherwise on #1. </p>
<p>*ponders*</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Heraldk</title>
		<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/comment-page-1/#comment-157</link>
		<dc:creator>Heraldk</dc:creator>
		<pubDate>Tue, 02 Sep 2008 16:49:22 +0000</pubDate>
		<guid isPermaLink="false">http://minoragenda.com/?p=55#comment-157</guid>
		<description>This is my most commented post on the site by far!

The red/blue hats are assigned randomly to each person, so you can&#039;t assume there is an equal number.</description>
		<content:encoded><![CDATA[<p>This is my most commented post on the site by far!</p>
<p>The red/blue hats are assigned randomly to each person, so you can&#8217;t assume there is an equal number.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rob</title>
		<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/comment-page-1/#comment-156</link>
		<dc:creator>Rob</dc:creator>
		<pubDate>Tue, 02 Sep 2008 16:36:26 +0000</pubDate>
		<guid isPermaLink="false">http://minoragenda.com/?p=55#comment-156</guid>
		<description>On #1 there ... are there an equal number of red and blue hats?</description>
		<content:encoded><![CDATA[<p>On #1 there &#8230; are there an equal number of red and blue hats?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rob</title>
		<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/comment-page-1/#comment-155</link>
		<dc:creator>Rob</dc:creator>
		<pubDate>Tue, 02 Sep 2008 14:38:44 +0000</pubDate>
		<guid isPermaLink="false">http://minoragenda.com/?p=55#comment-155</guid>
		<description>I actually had an answer for a couple of these, and then realized I can&#039;t read to save my life.  So, I am going to sit and stare at this all day some more and blame you for my lack of productivity :p</description>
		<content:encoded><![CDATA[<p>I actually had an answer for a couple of these, and then realized I can&#8217;t read to save my life.  So, I am going to sit and stare at this all day some more and blame you for my lack of productivity :p</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: darse</title>
		<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/comment-page-1/#comment-154</link>
		<dc:creator>darse</dc:creator>
		<pubDate>Fri, 29 Aug 2008 22:11:01 +0000</pubDate>
		<guid isPermaLink="false">http://minoragenda.com/?p=55#comment-154</guid>
		<description>&quot;Hey, how&#039;s it going?  I see you have the number 37 on your hat.  What else is new?&quot;  :-p

First two are okay, but not too tough.  I kind of angled the last problem a bit by looking at what information we have and don&#039;t have.  The problem is quite constrained -- few degrees of freedom makes it easier to get on the right path.  I clicked on the right idea rather quickly, but it took longer to work out the exact details.

I&#039;m not going to give you as many hints as Howard did though.  He was way way too soft on you guys -- he gave me *nothing*!</description>
		<content:encoded><![CDATA[<p>&#8220;Hey, how&#8217;s it going?  I see you have the number 37 on your hat.  What else is new?&#8221;  :-p</p>
<p>First two are okay, but not too tough.  I kind of angled the last problem a bit by looking at what information we have and don&#8217;t have.  The problem is quite constrained &#8212; few degrees of freedom makes it easier to get on the right path.  I clicked on the right idea rather quickly, but it took longer to work out the exact details.</p>
<p>I&#8217;m not going to give you as many hints as Howard did though.  He was way way too soft on you guys &#8212; he gave me *nothing*!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Heraldk</title>
		<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/comment-page-1/#comment-153</link>
		<dc:creator>Heraldk</dc:creator>
		<pubDate>Fri, 29 Aug 2008 21:20:13 +0000</pubDate>
		<guid isPermaLink="false">http://minoragenda.com/?p=55#comment-153</guid>
		<description>Yeah, I guess I didn&#039;t make it clear. The 2nd problem requires that no communication between people can happen. Everyone has time to look at each other&#039;s hats, but you can&#039;t talk or indicate anything to each other in any way.

This problem was posed late in the evening so I haven&#039;t had much of a chance to think about it yet. I hope to get around to it soon though :)</description>
		<content:encoded><![CDATA[<p>Yeah, I guess I didn&#8217;t make it clear. The 2nd problem requires that no communication between people can happen. Everyone has time to look at each other&#8217;s hats, but you can&#8217;t talk or indicate anything to each other in any way.</p>
<p>This problem was posed late in the evening so I haven&#8217;t had much of a chance to think about it yet. I hope to get around to it soon though :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kepi</title>
		<link>http://minoragenda.com/2008/08/29/hangin-with-howard-lederer/comment-page-1/#comment-152</link>
		<dc:creator>Kepi</dc:creator>
		<pubDate>Fri, 29 Aug 2008 21:04:11 +0000</pubDate>
		<guid isPermaLink="false">http://minoragenda.com/?p=55#comment-152</guid>
		<description>The seoncd one seems pretty easy, unless I&#039;m misunderstanding the rules of the scenario.

Before starting to let the people into the room, tell them the following:
1) the first person in is designated as the Picker
2) the Picker then watches as the subsequent people come into the room
3) if he sees two (or more people) with the same number, he places them together; everyone in that little grouping just calls out the numbers on the others&#039; hats
4) if he sees two or more hats that, when summed, add up to another number on a different person&#039;s hat, stick them together in a group, indicating which is the &quot;sum&quot; hat and which are the components of it. The &quot;sum&quot; guy calls out the sum of the other hats in the group</description>
		<content:encoded><![CDATA[<p>The seoncd one seems pretty easy, unless I&#8217;m misunderstanding the rules of the scenario.</p>
<p>Before starting to let the people into the room, tell them the following:<br />
1) the first person in is designated as the Picker<br />
2) the Picker then watches as the subsequent people come into the room<br />
3) if he sees two (or more people) with the same number, he places them together; everyone in that little grouping just calls out the numbers on the others&#8217; hats<br />
4) if he sees two or more hats that, when summed, add up to another number on a different person&#8217;s hat, stick them together in a group, indicating which is the &#8220;sum&#8221; hat and which are the components of it. The &#8220;sum&#8221; guy calls out the sum of the other hats in the group</p>
]]></content:encoded>
	</item>
</channel>
</rss>
