<?xml version="1.0" encoding="UTF-8" standalone="yes"?><oembed><version><![CDATA[1.0]]></version><provider_name><![CDATA[Too Much Free Time]]></provider_name><provider_url><![CDATA[https://tmft.wordpress.com]]></provider_url><author_name><![CDATA[Tracy Poff]]></author_name><author_url><![CDATA[https://tmft.wordpress.com/author/tracypoff/]]></author_url><title><![CDATA[Lucas&#8217;s Problem]]></title><type><![CDATA[link]]></type><html><![CDATA[<p><i>Lucas&#8217;s Problem</i> is a Windows 3.1 implementation by James Curran of a puzzle created by the French mathematician Édouard Lucas, who also created the more famous Towers of Hanoi puzzle.</p>
<div class="separator" style="clear:both;text-align:center;"><a href="https://tmft.files.wordpress.com/2009/01/bde81-snap003.png"><img src="https://tmft.files.wordpress.com/2009/01/bde81-snap003.png?w=300" border="0" /></a></div>
<p>The object is to reverse the positions of the colored blocks, so that red fills the right, and blue the left. Each color of blocks can only move in one direction (indicated by the arrows on these blocks) one space, or jump over a block of the opposite color.</p>
<div class="separator" style="clear:both;text-align:center;"><a href="https://tmft.files.wordpress.com/2009/01/73deb-snap004.png"><img src="https://tmft.files.wordpress.com/2009/01/73deb-snap004.png?w=300" border="0" /></a></div>
<p>There is, I think, only one way to solve this puzzle (up to reflection), so there&#8217;s not much to say. The puzzle isn&#8217;t hard to solve when you realize what situation leads to an unwinnable game, so this hasn&#8217;t got any replay value.</p>
<p>You can download <i>Lucas&#8217;s Problem</i>, or play a web based implementation, at <a href="http://www.noveltheory.com/">Novel Theory</a></p>
<dl>
<dt>Gameplay: 8/10</dt>
<dd>The game works and responds to clicks as expected. The puzzle is pretty clever, though not an invention of the game&#8217;s creator. There&#8217;s nothing <i>wrong</i> with the game, but there&#8217;s just nothing to it, so 8 is the highest score I can give it.</dd>
<dt>Graphics: 6/10</dt>
<dd>The graphics are very simple, but acceptable given the scope of the game. One can imagine a more visually pleasing implementation of the puzzle, even in 1990, so minus a few points for not really trying there.</dd>
<dt>Personal Slant: 5/10</dt>
<dd>Although I really do think that Lucas&#8217;s puzzle was quite clever, <i>Lucas&#8217;s Problem</i> has no replayability and offers no value beyond the satisfaction of solving a nice, though simple, puzzle.</dd>
<dt>Total: 6.33/10</dt>
<dd>The lack of replayability in this one was a killer for the game&#8217;s score. I&#8217;m not sure what could have been done to alleviate this&#8211;perhaps if the scope of the game had been larger, implementing several similar games, like Towers of Hanoi, it might have made the game worth a second look. As it is, though, even if the puzzle is worth remembering, the game will be soon forgotten.</dd>
</dl>
]]></html><thumbnail_url><![CDATA[https://tmft.files.wordpress.com/2009/01/bde81-snap003.png?w=300&fit=440%2C330]]></thumbnail_url><thumbnail_width><![CDATA[]]></thumbnail_width><thumbnail_height><![CDATA[]]></thumbnail_height></oembed>