<?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: Thoughts on a game of Boggle</title>
	<atom:link href="http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle/</link>
	<description></description>
	<lastBuildDate>Wed, 30 Nov 2011 18:21:52 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: liliana</title>
		<link>http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle/comment-page-1/#comment-5162</link>
		<dc:creator>liliana</dc:creator>
		<pubDate>Wed, 10 Sep 2008 22:59:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle#comment-5162</guid>
		<description>&lt;p&gt;boggle sucks!!&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>boggle sucks!!</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Looking Out To Sea &#187; Solving the problem of Boggle</title>
		<link>http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle/comment-page-1/#comment-222</link>
		<dc:creator>Looking Out To Sea &#187; Solving the problem of Boggle</dc:creator>
		<pubDate>Tue, 15 Jan 2008 22:17:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle#comment-222</guid>
		<description>&lt;p&gt;[...] few days I looked at the game of Boggle with a view to writing a program to solve the same problem that the user has: find as many (long) [...]&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>[&#8230;] few days I looked at the game of Boggle with a view to writing a program to solve the same problem that the user has: find as many (long) [&#8230;]</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Dougal</title>
		<link>http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle/comment-page-1/#comment-184</link>
		<dc:creator>Dougal</dc:creator>
		<pubDate>Wed, 09 Jan 2008 10:30:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle#comment-184</guid>
		<description>&lt;p&gt;Very true! That approach had not occurred to me --- at least, not in so many words. The U is really a modifier rather than a real letter (when following Q, obviously; not elsewhere). But Q doesn&#039;t appear &lt;em&gt;without&lt;/em&gt; the modifier so it&#039;s effectively not there.&lt;/p&gt;

&lt;p&gt;So we strip the redundant modifier from the dictionary words (and filter those words that contain unmodified Q). This is (more or less) the safe strings problem if we consider the &quot;qu&quot; string as an unsafe entity that needs to be escaped.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Very true! That approach had not occurred to me &#8212; at least, not in so many words. The U is really a modifier rather than a real letter (when following Q, obviously; not elsewhere). But Q doesn&#8217;t appear <em>without</em> the modifier so it&#8217;s effectively not there.</p>

<p>So we strip the redundant modifier from the dictionary words (and filter those words that contain unmodified Q). This is (more or less) the safe strings problem if we consider the &#8220;qu&#8221; string as an unsafe entity that needs to be escaped.</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Lawrence</title>
		<link>http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle/comment-page-1/#comment-183</link>
		<dc:creator>Lawrence</dc:creator>
		<pubDate>Wed, 09 Jan 2008 09:49:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.dougalstanton.net/blog/index.php/2008/01/08/thoughts-on-a-game-of-boggle#comment-183</guid>
		<description>&lt;p&gt;So the Qu problem is easy to solve, because there is no side of any of the dice that has just a Q on it.  Hence, you can&#039;t spell any words in your dictionary that have a Q followed by a letter other than U, so when reading the dictionary remove them.  Now replace all QU sequences with just Q.  Now you can treat Qu as a single letter and continue blithely on your way.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>So the Qu problem is easy to solve, because there is no side of any of the dice that has just a Q on it.  Hence, you can&#8217;t spell any words in your dictionary that have a Q followed by a letter other than U, so when reading the dictionary remove them.  Now replace all QU sequences with just Q.  Now you can treat Qu as a single letter and continue blithely on your way.</p>]]></content:encoded>
	</item>
</channel>
</rss>

