<?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: The 24 Puzzle</title>
	<atom:link href="http://imprompt.us/2009/the-24-puzzle/feed/" rel="self" type="application/rss+xml" />
	<link>http://imprompt.us/2009/the-24-puzzle/</link>
	<description>Computer Science and Teaching and Other Ancillary Things</description>
	<lastBuildDate>Sat, 24 Jul 2010 12:23:13 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: Peter Boothe</title>
		<link>http://imprompt.us/2009/the-24-puzzle/comment-page-1/#comment-16742</link>
		<dc:creator>Peter Boothe</dc:creator>
		<pubDate>Wed, 09 Dec 2009 03:57:59 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/?p=141#comment-16742</guid>
		<description>&quot;Free time&quot;, hah!</description>
		<content:encoded><![CDATA[<p>&#8220;Free time&#8221;, hah!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: F. Carr</title>
		<link>http://imprompt.us/2009/the-24-puzzle/comment-page-1/#comment-16741</link>
		<dc:creator>F. Carr</dc:creator>
		<pubDate>Wed, 09 Dec 2009 00:17:47 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/?p=141#comment-16741</guid>
		<description>So a random choice still has a 1/6 to 1/5 chance of FAIL.  Neat, thanks :-)&lt;br&gt;&lt;br&gt;I wonder if the hardcore kiddies memorize these FAIL patterns like Scrabblers memorizing the drop-all-7-letters patterns, or if these patterns are just disallowed?  On the other hand, if there are &quot;only&quot; 404 patterns that use digits 1-9 and are feasible, maybe those 404 could be committed to memory...&lt;br&gt;&lt;br&gt;Or maybe one could enumerate all solutions for those 404 patterns, then find the smallest set of solution-methods that cover the largest number of those patterns with a solution!  Like, &quot;our analysis produced 5 solution-methods that cover 94.2% of all cases.&quot;&lt;br&gt;&lt;br&gt;It&#039;s a good thing you&#039;re a prof and have time to work on these things.  I&#039;m coding in python, so I don&#039;t even have a compile-step --- I have to be running the build-regressions to get a decent block of productive-yet-idle time :-)</description>
		<content:encoded><![CDATA[<p>So a random choice still has a 1/6 to 1/5 chance of FAIL.  Neat, thanks <img src='http://imprompt.us/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
<p>I wonder if the hardcore kiddies memorize these FAIL patterns like Scrabblers memorizing the drop-all-7-letters patterns, or if these patterns are just disallowed?  On the other hand, if there are &#8220;only&#8221; 404 patterns that use digits 1-9 and are feasible, maybe those 404 could be committed to memory&#8230;</p>
<p>Or maybe one could enumerate all solutions for those 404 patterns, then find the smallest set of solution-methods that cover the largest number of those patterns with a solution!  Like, &#8220;our analysis produced 5 solution-methods that cover 94.2% of all cases.&#8221;</p>
<p>It&#39;s a good thing you&#39;re a prof and have time to work on these things.  I&#39;m coding in python, so I don&#39;t even have a compile-step &#8212; I have to be running the build-regressions to get a decent block of productive-yet-idle time <img src='http://imprompt.us/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Boothe</title>
		<link>http://imprompt.us/2009/the-24-puzzle/comment-page-1/#comment-16740</link>
		<dc:creator>Peter Boothe</dc:creator>
		<pubDate>Tue, 08 Dec 2009 02:30:40 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/?p=141#comment-16740</guid>
		<description>495 != 9*9*9*9&lt;br&gt;&lt;br&gt;This is because we treat 1,1,1,2 the same as 1,1,2,1.</description>
		<content:encoded><![CDATA[<p>495 != 9*9*9*9</p>
<p>This is because we treat 1,1,1,2 the same as 1,1,2,1.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Boothe</title>
		<link>http://imprompt.us/2009/the-24-puzzle/comment-page-1/#comment-16739</link>
		<dc:creator>Peter Boothe</dc:creator>
		<pubDate>Tue, 08 Dec 2009 02:22:44 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/?p=141#comment-16739</guid>
		<description>&lt;code&gt;$ grep -v &#039;[0-9][0-9]&#039; rawoutput.txt  &#124; wc -l&lt;br&gt;495&lt;br&gt;$ grep -v &#039;[0-9][0-9]&#039; rawoutput.txt &#124; grep No &#124; wc -l&lt;br&gt;91&lt;/code&gt;&lt;br&gt;&lt;br&gt;91 out of 495 problems have no solution.</description>
		<content:encoded><![CDATA[<div class="codecolorer-container text default" style="overflow:auto;white-space:nowrap;border:1px solid #9F9F9F;width:435px;"><div class="text codecolorer" style="padding:5px;font:normal 12px/1.4em Monaco, Lucida Console, monospace;white-space:nowrap">$ grep -v &amp;#39;[0-9][0-9]&amp;#39; rawoutput.txt &nbsp;| wc -l&lt;br&gt;495&lt;br&gt;$ grep -v &amp;#39;[0-9][0-9]&amp;#39; rawoutput.txt | grep No | wc -l&lt;br&gt;91</div></div>
<p>91 out of 495 problems have no solution.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: F. Carr</title>
		<link>http://imprompt.us/2009/the-24-puzzle/comment-page-1/#comment-16738</link>
		<dc:creator>F. Carr</dc:creator>
		<pubDate>Tue, 08 Dec 2009 00:37:01 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/?p=141#comment-16738</guid>
		<description>Uh... the comment-posting for this site + my webbrowser is not teh awesome?</description>
		<content:encoded><![CDATA[<p>Uh&#8230; the comment-posting for this site + my webbrowser is not teh awesome?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: F. Carr</title>
		<link>http://imprompt.us/2009/the-24-puzzle/comment-page-1/#comment-16737</link>
		<dc:creator>F. Carr</dc:creator>
		<pubDate>Tue, 08 Dec 2009 00:36:14 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/?p=141#comment-16737</guid>
		<description>Definitely teh awesome :-)&lt;br&gt;&lt;br&gt;The wikipedia page says the game is played with numbers 1-9 versus 1-[N].  (Or for the HARDCORE kiddies, -9 to 9 with some fractions thrown in.  But &quot;meh&quot; to the hardcore.)  Question: what fraction of the 9*9*9*9 problems using just digits 1-9 have no solution?</description>
		<content:encoded><![CDATA[<p>Definitely teh awesome <img src='http://imprompt.us/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
<p>The wikipedia page says the game is played with numbers 1-9 versus 1-[N].  (Or for the HARDCORE kiddies, -9 to 9 with some fractions thrown in.  But &#8220;meh&#8221; to the hardcore.)  Question: what fraction of the 9*9*9*9 problems using just digits 1-9 have no solution?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: F. Carr</title>
		<link>http://imprompt.us/2009/the-24-puzzle/comment-page-1/#comment-16736</link>
		<dc:creator>F. Carr</dc:creator>
		<pubDate>Tue, 08 Dec 2009 00:27:48 +0000</pubDate>
		<guid isPermaLink="false">http://imprompt.us/?p=141#comment-16736</guid>
		<description>Definitely teh awesome :-)&lt;br&gt;&lt;br&gt;The wikipedia page says the game is played with numbers 1-9 versus 1-[N].  (Or for the HARDCORE kiddies, -9 to 9 with some fractions thrown in.  But &quot;meh&quot; to the hardcore.)  Question: what fraction of the 9*9*9*9 problems using just digits 1-9 have no solution?</description>
		<content:encoded><![CDATA[<p>Definitely teh awesome <img src='http://imprompt.us/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
<p>The wikipedia page says the game is played with numbers 1-9 versus 1-[N].  (Or for the HARDCORE kiddies, -9 to 9 with some fractions thrown in.  But &#8220;meh&#8221; to the hardcore.)  Question: what fraction of the 9*9*9*9 problems using just digits 1-9 have no solution?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
