<?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: A little puzzle</title>
	<atom:link href="http://programmerthoughts.com/thoughts/a-little-puzzle/feed/" rel="self" type="application/rss+xml" />
	<link>http://programmerthoughts.com/thoughts/a-little-puzzle/</link>
	<description></description>
	<lastBuildDate>Sun, 25 Jul 2010 16:59:04 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: clay</title>
		<link>http://programmerthoughts.com/thoughts/a-little-puzzle/#comment-76</link>
		<dc:creator>clay</dc:creator>
		<pubDate>Thu, 13 Aug 2009 18:19:16 +0000</pubDate>
		<guid isPermaLink="false">http://johnandkaren.com/blog/?p=230#comment-76</guid>
		<description>The fishing one is easy.  You only keep 10 fish in the pot at all times - as you catch another you throw out the smallest.  (If the warden counts 11 fish in the boat as disqualify, you may only be able to hold onto 9 at a time)

I actually would expect acceptance slots to filled in the same manor.  Each time you want to add a new candidate beyond the limit of available seats - you have to decide who you&#039;re going to toss out.

I&#039;m unclear on the boxes problem.  Do you (when offering me a box) know before hand the amount of money in it?  Or it&#039;s a surprise to us both after I choose to pass?  If I don&#039;t know the amount of the money in the box until after I choose - how could I possibly strategize?  Can I shake them like a Christmas gift?  ;)</description>
		<content:encoded><![CDATA[<p>The fishing one is easy.  You only keep 10 fish in the pot at all times &#8211; as you catch another you throw out the smallest.  (If the warden counts 11 fish in the boat as disqualify, you may only be able to hold onto 9 at a time)</p>
<p>I actually would expect acceptance slots to filled in the same manor.  Each time you want to add a new candidate beyond the limit of available seats &#8211; you have to decide who you&#8217;re going to toss out.</p>
<p>I&#8217;m unclear on the boxes problem.  Do you (when offering me a box) know before hand the amount of money in it?  Or it&#8217;s a surprise to us both after I choose to pass?  If I don&#8217;t know the amount of the money in the box until after I choose &#8211; how could I possibly strategize?  Can I shake them like a Christmas gift?  ;)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://programmerthoughts.com/thoughts/a-little-puzzle/#comment-75</link>
		<dc:creator>John</dc:creator>
		<pubDate>Sat, 09 May 2009 20:19:48 +0000</pubDate>
		<guid isPermaLink="false">http://johnandkaren.com/blog/?p=230#comment-75</guid>
		<description>&lt;a href=&quot;#comment-309&quot; rel=&quot;nofollow&quot;&gt;@Jon&lt;/a&gt;
I think that&#039;s probably how the essays are graded. It makes a lot of sense. When I first heard it, though, I thought about it from a computer science perspective, and, as always in CS, the issue is scale. A few hundred papers to grade would be tedious, but not impossible. A few thousand gets really difficult, and over ten thousand gets close to impossible. (But what happens if you have a few million?) Even if (or especially if) there are multiple graders, how do you ensure that the best get in? Perhaps you need to adjust each grader&#039;s results and then adjust all of the graders together, but that doesn&#039;t seen like a fair system to those who are on the edge--those that are either right above or right below the cutoff.</description>
		<content:encoded><![CDATA[<p><a href="#comment-309" rel="nofollow">@Jon</a><br />
I think that&#8217;s probably how the essays are graded. It makes a lot of sense. When I first heard it, though, I thought about it from a computer science perspective, and, as always in CS, the issue is scale. A few hundred papers to grade would be tedious, but not impossible. A few thousand gets really difficult, and over ten thousand gets close to impossible. (But what happens if you have a few million?) Even if (or especially if) there are multiple graders, how do you ensure that the best get in? Perhaps you need to adjust each grader&#8217;s results and then adjust all of the graders together, but that doesn&#8217;t seen like a fair system to those who are on the edge&#8211;those that are either right above or right below the cutoff.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jon</title>
		<link>http://programmerthoughts.com/thoughts/a-little-puzzle/#comment-74</link>
		<dc:creator>Jon</dc:creator>
		<pubDate>Sat, 09 May 2009 16:49:27 +0000</pubDate>
		<guid isPermaLink="false">http://johnandkaren.com/blog/?p=230#comment-74</guid>
		<description>Well, since I&#039;ve been in education for a while, maybe I can share a plausible essay rating strategy.

First, read each on and grade it somehow (could include grammar, substance, etc.).  Then, when all are graded as such, use a simple bell curve to stratify them.  Then, simply send acceptance letters to the top percentage.

Sorry, I have no idea of how to do the boxes either, though I find that far harder than grading app essays.</description>
		<content:encoded><![CDATA[<p>Well, since I&#8217;ve been in education for a while, maybe I can share a plausible essay rating strategy.</p>
<p>First, read each on and grade it somehow (could include grammar, substance, etc.).  Then, when all are graded as such, use a simple bell curve to stratify them.  Then, simply send acceptance letters to the top percentage.</p>
<p>Sorry, I have no idea of how to do the boxes either, though I find that far harder than grading app essays.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Justin Allison</title>
		<link>http://programmerthoughts.com/thoughts/a-little-puzzle/#comment-73</link>
		<dc:creator>Justin Allison</dc:creator>
		<pubDate>Fri, 08 May 2009 05:12:25 +0000</pubDate>
		<guid isPermaLink="false">http://johnandkaren.com/blog/?p=230#comment-73</guid>
		<description>I&#039;m going to think about this one. When I&#039;m tired - like now, I would probably just take the first ten, and then go to sleep.</description>
		<content:encoded><![CDATA[<p>I&#8217;m going to think about this one. When I&#8217;m tired &#8211; like now, I would probably just take the first ten, and then go to sleep.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
