<?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: Peons</title>
	<atom:link href="http://yaniv.leviathanonline.com/blog/riddles/peons/feed/" rel="self" type="application/rss+xml" />
	<link>http://yaniv.leviathanonline.com/blog/riddles/peons/</link>
	<description>Strain your Brain</description>
	<lastBuildDate>Tue, 31 Aug 2010 17:39:33 -0700</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: srulix</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/peons/comment-page-1/#comment-8981</link>
		<dc:creator>srulix</dc:creator>
		<pubDate>Fri, 16 May 2008 11:27:43 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/peons/#comment-8981</guid>
		<description>The core of the solution is this: Assume your target is (c,5) for some c. To each square assign &quot;potential&quot; function p(x,y). The potential of the board is the sum of p(x,y) for (x,y) which have a pawn on them. The potential function must be carefully-chosen, you need to show that the potential of the board stays constant (or decreases) for each move. Now, you&#039;re left with showing that p(c,5) is greater than the original potential (or exactly equal, since the number of steps must be finite).

The initial thought is to set p(x,y) with something that resembles Fibonacci series, since p(x,y)&gt;=p(x,y+1)+p(x,y+2). But this results with an alternating and unbounded potential :(. That thought must be a tad-bit refined, and you&#039;ll have the solution.

Great riddle, I&#039;m putting it on my page :)</description>
		<content:encoded><![CDATA[<p>The core of the solution is this: Assume your target is (c,5) for some c. To each square assign &#8220;potential&#8221; function p(x,y). The potential of the board is the sum of p(x,y) for (x,y) which have a pawn on them. The potential function must be carefully-chosen, you need to show that the potential of the board stays constant (or decreases) for each move. Now, you&#8217;re left with showing that p(c,5) is greater than the original potential (or exactly equal, since the number of steps must be finite).</p>
<p>The initial thought is to set p(x,y) with something that resembles Fibonacci series, since p(x,y)&gt;=p(x,y+1)+p(x,y+2). But this results with an alternating and unbounded potential <img src='http://leviathanonline.com/wordpress/wp-includes/images/smilies/icon_sad.gif' alt=':(' class='wp-smiley' /> . That thought must be a tad-bit refined, and you&#8217;ll have the solution.</p>
<p>Great riddle, I&#8217;m putting it on my page <img src='http://leviathanonline.com/wordpress/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: yaniv</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/peons/comment-page-1/#comment-386</link>
		<dc:creator>yaniv</dc:creator>
		<pubDate>Thu, 22 Nov 2007 00:18:28 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/peons/#comment-386</guid>
		<description>Well, I think its time I posted a hint.

&lt;strong&gt;WARNING - SEMI-SPOILER!&lt;/strong&gt;

It is actually impossible to achieve the required task!
You cannot move a peon to 5 squares above the line.
Now try to prove that...

PS - Seb, you&#039;re numbers are pretty close. I do not really remember, but I think that the required number for getting to 4 squares above the line is 20. Anyways, proving 5 is impossible is much nicer than calculating the required number for 4. 8-)</description>
		<content:encoded><![CDATA[<p>Well, I think its time I posted a hint.</p>
<p><strong>WARNING &#8211; SEMI-SPOILER!</strong></p>
<p>It is actually impossible to achieve the required task!<br />
You cannot move a peon to 5 squares above the line.<br />
Now try to prove that&#8230;</p>
<p>PS &#8211; Seb, you&#8217;re numbers are pretty close. I do not really remember, but I think that the required number for getting to 4 squares above the line is 20. Anyways, proving 5 is impossible is much nicer than calculating the required number for 4. <img src='http://leviathanonline.com/wordpress/wp-includes/images/smilies/icon_cool.gif' alt='8-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Seb</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/peons/comment-page-1/#comment-297</link>
		<dc:creator>Seb</dc:creator>
		<pubDate>Wed, 07 Nov 2007 21:03:43 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/peons/#comment-297</guid>
		<description>If n is the “height” of a single peon above the line (n=1 being the first square above the red line), then the first few terms are
n=0 –&gt; 0 (no peons are needed)
n=1 –&gt; 2 (the first example)
n=2 –&gt; 4 (the second example)
n=3 –&gt; 8 (since you first need a n=2 peon and need to reconstruct the “cannon” below the line)

It would of course be esthetical to have n=4 –&gt; 16 but this is clearly not the case. I have found a n=4 --&gt; 21 solution, so it is clear that the solution for n=5 is at least higher than 29.</description>
		<content:encoded><![CDATA[<p>If n is the “height” of a single peon above the line (n=1 being the first square above the red line), then the first few terms are<br />
n=0 –&gt; 0 (no peons are needed)<br />
n=1 –&gt; 2 (the first example)<br />
n=2 –&gt; 4 (the second example)<br />
n=3 –&gt; 8 (since you first need a n=2 peon and need to reconstruct the “cannon” below the line)</p>
<p>It would of course be esthetical to have n=4 –&gt; 16 but this is clearly not the case. I have found a n=4 &#8211;&gt; 21 solution, so it is clear that the solution for n=5 is at least higher than 29.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Seb</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/peons/comment-page-1/#comment-296</link>
		<dc:creator>Seb</dc:creator>
		<pubDate>Wed, 07 Nov 2007 20:25:38 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/peons/#comment-296</guid>
		<description>Sorry about that. I thought all comments went automatically to the second page. My mistake - but since it&#039;s far from a solution, I guess I won&#039;t have spoiled the fun.</description>
		<content:encoded><![CDATA[<p>Sorry about that. I thought all comments went automatically to the second page. My mistake &#8211; but since it&#8217;s far from a solution, I guess I won&#8217;t have spoiled the fun.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: yaniv</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/peons/comment-page-1/#comment-294</link>
		<dc:creator>yaniv</dc:creator>
		<pubDate>Wed, 07 Nov 2007 19:32:36 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/peons/#comment-294</guid>
		<description>Hi Seb,

Your numbers are right ;-)

Now, although your comment is not a solution, (it is at most a very slim hint), in the future, please post such comments on the second page of riddles, so as not to spoil the riddle for people that haven&#039;t solved it yet. That said, this type of comments is excellent, and please keep posting such insights.

On article posts, you are welcome to comment anywhere (i.e. you cannot &quot;spoil&quot; an article).

Thanks!</description>
		<content:encoded><![CDATA[<p>Hi Seb,</p>
<p>Your numbers are right <img src='http://leviathanonline.com/wordpress/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> </p>
<p>Now, although your comment is not a solution, (it is at most a very slim hint), in the future, please post such comments on the second page of riddles, so as not to spoil the riddle for people that haven&#8217;t solved it yet. That said, this type of comments is excellent, and please keep posting such insights.</p>
<p>On article posts, you are welcome to comment anywhere (i.e. you cannot &#8220;spoil&#8221; an article).</p>
<p>Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Seb</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/peons/comment-page-1/#comment-292</link>
		<dc:creator>Seb</dc:creator>
		<pubDate>Wed, 07 Nov 2007 16:25:51 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/peons/#comment-292</guid>
		<description>If n is the &quot;height&quot; of a single peon above the line (n=1 being the first square above the red line), then the first few terms are
n=0 --&gt; 0 (no peons are needed)
n=1 --&gt; 2 (the first example)
n=2 --&gt; 4 (the second example)
n=3 --&gt; 8 (since you first need a n=2 peon and need to reconstruct the &quot;cannon&quot; below the line)

It would of course be esthetical to have n=4 --&gt; 16 but this is clearly not the case.</description>
		<content:encoded><![CDATA[<p>If n is the &#8220;height&#8221; of a single peon above the line (n=1 being the first square above the red line), then the first few terms are<br />
n=0 &#8211;&gt; 0 (no peons are needed)<br />
n=1 &#8211;&gt; 2 (the first example)<br />
n=2 &#8211;&gt; 4 (the second example)<br />
n=3 &#8211;&gt; 8 (since you first need a n=2 peon and need to reconstruct the &#8220;cannon&#8221; below the line)</p>
<p>It would of course be esthetical to have n=4 &#8211;&gt; 16 but this is clearly not the case.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
