<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" 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/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" version="2.0">

<channel>
	<title>Programmer Puzzlers</title>
	
	<link>http://programmerpuzzlers.com</link>
	<description>logic and coding puzzles to bend your brain and teach you to think smarter</description>
	<lastBuildDate>Wed, 08 Sep 2010 19:29:38 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/rss+xml" href="http://feeds.feedburner.com/ProgrammerPuzzlers" /><feedburner:info xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" uri="programmerpuzzlers" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><feedburner:emailServiceId xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0">ProgrammerPuzzlers</feedburner:emailServiceId><feedburner:feedburnerHostname xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0">http://feedburner.google.com</feedburner:feedburnerHostname><item>
		<title>Family Crossing</title>
		<link>http://programmerpuzzlers.com/family-crossing/</link>
		<comments>http://programmerpuzzlers.com/family-crossing/#comments</comments>
		<pubDate>Wed, 08 Sep 2010 19:29:38 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Logic]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=54</guid>
		<description><![CDATA[Today&#8217;s puzzler is from Borrow-A-Geek:
There are two sons and a dad, a row boat and a river to cross.
Each son weighs 75lbs
The dad weighs 150lbs
The row boat capacity is 150lbs
They all need to get accross the river, how can they do this with out ropes or any fancy tricks?
]]></description>
			<content:encoded><![CDATA[<p><em>Today&#8217;s puzzler is from <a href="http://www.ozzu.com/general-discussion/riddles-brain-benders-t671.html">Borrow-A-Geek</a>:</em></p>
<p>There are two sons and a dad, a row boat and a river to cross.</p>
<p>Each son weighs 75lbs<br />
The dad weighs 150lbs</p>
<p>The row boat capacity is 150lbs</p>
<p><strong>They all need to get accross the river, how can they do this with out ropes or any fancy tricks?</strong></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/family-crossing/feed/</wfw:commentRss>
		<slash:comments>21</slash:comments>
		</item>
		<item>
		<title>Code One-Liner</title>
		<link>http://programmerpuzzlers.com/code-one-liner/</link>
		<comments>http://programmerpuzzlers.com/code-one-liner/#comments</comments>
		<pubDate>Tue, 17 Aug 2010 09:00:44 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Code]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=52</guid>
		<description><![CDATA[From Ben via a dead link:
history &#124; awk '{a[$2]++}END{for(i in a){print a[i] " " i}}' &#124; sort  -rn &#124; head
What does this one-line shell command do, and how exactly does it do it?
]]></description>
			<content:encoded><![CDATA[<p>From <a href="http://www.rotskyinstitute.com/">Ben</a> via a dead link:</p>
<p><code>history | awk '{a[$2]++}END{for(i in a){print a[i] " " i}}' | sort  -rn | head</code></p>
<p><em><strong>What does this one-line shell command do, and how exactly does it do it?</strong></em></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/code-one-liner/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Someone Take This Shovel Out Of My Hands</title>
		<link>http://programmerpuzzlers.com/someone-take-this-shovel-out-of-my-hands/</link>
		<comments>http://programmerpuzzlers.com/someone-take-this-shovel-out-of-my-hands/#comments</comments>
		<pubDate>Tue, 10 Aug 2010 09:00:28 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Logic]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=50</guid>
		<description><![CDATA[From Julio Sepia:
It takes one day for ten workers to dig ten holes.
It takes two days for five workers to dig ten holes.
How much does it take for one man to dig HALF a hole?
]]></description>
			<content:encoded><![CDATA[<p>From <a href="http://www.twitter.com/jsepia">Julio Sepia</a>:</p>
<p>It takes one day for ten workers to dig ten holes.<br />
It takes two days for five workers to dig ten holes.</p>
<p><em><strong>How much does it take for one man to dig HALF a hole?</strong></em></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/someone-take-this-shovel-out-of-my-hands/feed/</wfw:commentRss>
		<slash:comments>10</slash:comments>
		</item>
		<item>
		<title>Chmod Math</title>
		<link>http://programmerpuzzlers.com/chmod-math/</link>
		<comments>http://programmerpuzzlers.com/chmod-math/#comments</comments>
		<pubDate>Tue, 03 Aug 2010 09:00:49 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Math]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=47</guid>
		<description><![CDATA[From Julio Sepia:
Write the number 755 as the sum of five consecutive odd numbers.
]]></description>
			<content:encoded><![CDATA[<p>From <a href="http://www.twitter.com/jsepia">Julio Sepia</a>:</p>
<p>Write the number 755 as the sum of five consecutive odd numbers.</p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/chmod-math/feed/</wfw:commentRss>
		<slash:comments>11</slash:comments>
		</item>
		<item>
		<title>Desert Tracks</title>
		<link>http://programmerpuzzlers.com/desert-tracks/</link>
		<comments>http://programmerpuzzlers.com/desert-tracks/#comments</comments>
		<pubDate>Tue, 27 Jul 2010 21:05:15 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Logic]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=44</guid>
		<description><![CDATA[From Andreas Renberg:
A large caravan is stuck in the desert. They have enough food and water  to last them a while, but still need to send someone to find help.
The nearest city is a 7 day journey, but each person is only able to  carry 4 days worth of food.
What do they do [...]]]></description>
			<content:encoded><![CDATA[<p>From <a href="http://iqandreas.blogspot.com/">Andreas Renberg</a>:</p>
<p>A large caravan is stuck in the desert. They have enough food and water  to last them a while, but still need to send someone to find help.</p>
<p>The nearest city is a 7 day journey, but each person is only able to  carry 4 days worth of food.</p>
<p><em><strong>What do they do so that everyone gets out alive?</strong></em></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/desert-tracks/feed/</wfw:commentRss>
		<slash:comments>14</slash:comments>
		</item>
		<item>
		<title>Which Switch?</title>
		<link>http://programmerpuzzlers.com/which-switch/</link>
		<comments>http://programmerpuzzlers.com/which-switch/#comments</comments>
		<pubDate>Tue, 20 Jul 2010 09:00:51 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Logic]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=42</guid>
		<description><![CDATA[From Sean Murphy:
There are 1000 switches numbered from 1 to 1000.  They are all off. I begin by flicking all the switches. I then flick every second switch (2,4,6&#8230;). I then flick every third switch (3,6,9&#8230;). I repeat the process 1000 times.
How many switches are off by the time I have finished?
]]></description>
			<content:encoded><![CDATA[<p>From Sean Murphy:</p>
<p>There are 1000 switches numbered from 1 to 1000.  They are all off. I begin by flicking all the switches. I then flick every second switch (2,4,6&#8230;). I then flick every third switch (3,6,9&#8230;). I repeat the process 1000 times.</p>
<p><em><strong>How many switches are off by the time I have finished?</strong></em></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/which-switch/feed/</wfw:commentRss>
		<slash:comments>26</slash:comments>
		</item>
		<item>
		<title>Lie Detector</title>
		<link>http://programmerpuzzlers.com/lie-detector/</link>
		<comments>http://programmerpuzzlers.com/lie-detector/#comments</comments>
		<pubDate>Tue, 13 Jul 2010 10:00:27 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Logic]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=27</guid>
		<description><![CDATA[From fretje:
When you die, you go to this place where there are two doors: one goes  to heaven, the other one goes to hell. There&#8217;s a guard in front of each door. You don&#8217;t know which door is which. The only thing you know is that one of the guards is always telling the [...]]]></description>
			<content:encoded><![CDATA[<p>From fretje:</p>
<p>When you die, you go to this place where there are two doors: one goes  to heaven, the other one goes to hell. There&#8217;s a guard in front of each door. You don&#8217;t know which door is which. The only thing you know is that one of the guards is always telling the truth, while the other one is always lying. You can ask one question to one of the guards.</p>
<p><em><strong>How do  you know which door to take to get to heaven?</strong></em></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/lie-detector/feed/</wfw:commentRss>
		<slash:comments>18</slash:comments>
		</item>
		<item>
		<title>Bomb Planning</title>
		<link>http://programmerpuzzlers.com/bomb-planning/</link>
		<comments>http://programmerpuzzlers.com/bomb-planning/#comments</comments>
		<pubDate>Tue, 06 Jul 2010 10:00:17 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Logic]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=29</guid>
		<description><![CDATA[From asas:
You have two 4 min fuses and a bomb. You want to be able to time the  detonation of the bomb for 1min. Like the ropes puzzle, neither fuse  burns at a uniform rate throughout.
How do you time your act of  senseless destruction?
]]></description>
			<content:encoded><![CDATA[<p>From asas:</p>
<p>You have two 4 min fuses and a bomb. You want to be able to time the  detonation of the bomb for 1min. Like the <a href="http://programmerpuzzlers.com/burning-ropes/">ropes puzzle</a>, neither fuse  burns at a uniform rate throughout.</p>
<p><em><strong>How do you time your act of  senseless destruction?</strong></em></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/bomb-planning/feed/</wfw:commentRss>
		<slash:comments>18</slash:comments>
		</item>
		<item>
		<title>Time Angles</title>
		<link>http://programmerpuzzlers.com/time-angles/</link>
		<comments>http://programmerpuzzlers.com/time-angles/#comments</comments>
		<pubDate>Tue, 29 Jun 2010 21:12:27 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Math]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=17</guid>
		<description><![CDATA[The setup for this puzzler is quite simple.  You have an ordinary clock and the time is exactly 3:15 pm.
What is the angle between the two hands of the clock?
]]></description>
			<content:encoded><![CDATA[<p>The setup for this puzzler is quite simple.  You have an ordinary clock and the time is exactly 3:15 pm.</p>
<p><em><strong>What is the angle between the two hands of the clock?</strong></em></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/time-angles/feed/</wfw:commentRss>
		<slash:comments>24</slash:comments>
		</item>
		<item>
		<title>Circular Quarters</title>
		<link>http://programmerpuzzlers.com/circular-quarters/</link>
		<comments>http://programmerpuzzlers.com/circular-quarters/#comments</comments>
		<pubDate>Tue, 22 Jun 2010 01:11:10 +0000</pubDate>
		<dc:creator>Amber Shah</dc:creator>
				<category><![CDATA[Logic]]></category>

		<guid isPermaLink="false">http://programmerpuzzlers.com/?p=15</guid>
		<description><![CDATA[You are playing a game with your friend sitting across a perfectly round tabletop.  You each have a supply of quarters which you will place on the table one at a time, without moving any other quarters and without overlapping.  The last person who successfully puts a quarter on the table without running [...]]]></description>
			<content:encoded><![CDATA[<p>You are playing a game with your friend sitting across a perfectly round tabletop.  You each have a supply of quarters which you will place on the table one at a time, without moving any other quarters and without overlapping.  The last person who successfully puts a quarter on the table without running out of space on the table wins the game.  You get the lucky break of going first.</p>
<p><em><strong>Where should you put your quarter to ensure that you win, and why?</strong></em></p>
<p><span style="font-size:10pt">[Bonus Round] You don&#8217;t get to go first.  Depending on where your partner puts his quarter first, where do you put your quarter second to best your odds?  Can you guarantee a win or a stalemate?</span></p>
]]></content:encoded>
			<wfw:commentRss>http://programmerpuzzlers.com/circular-quarters/feed/</wfw:commentRss>
		<slash:comments>15</slash:comments>
		</item>
	</channel>
</rss>

