<?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: One Last Boggle Boost</title>
	<atom:link href="http://www.danvk.org/wp/2007-02-10/one-last-boggle-boost/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.danvk.org/wp/2007-02-10/one-last-boggle-boost/</link>
	<description>Keepin' static like wool fabric since 2006</description>
	<lastBuildDate>Sun, 05 Feb 2012 04:54:46 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: danvk.org &#187; Breaking 3&#215;3 Boggle</title>
		<link>http://www.danvk.org/wp/2007-02-10/one-last-boggle-boost/comment-page-1/#comment-23501</link>
		<dc:creator>danvk.org &#187; Breaking 3&#215;3 Boggle</dc:creator>
		<pubDate>Sat, 08 Aug 2009 17:35:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=89#comment-23501</guid>
		<description>[...] there are so many boards to consider: 2^72 for the 4&#215;4 case and 2^40 for the 3&#215;3 case. At 10,000 boards/second former corresponds to about 2 billion years of compute time, and the latter just two years. Just [...]</description>
		<content:encoded><![CDATA[<p>[...] there are so many boards to consider: 2^72 for the 4&#215;4 case and 2^40 for the 3&#215;3 case. At 10,000 boards/second former corresponds to about 2 billion years of compute time, and the latter just two years. Just [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: danvk.org &#187; Solving Boggle by Taking Option Three</title>
		<link>http://www.danvk.org/wp/2007-02-10/one-last-boggle-boost/comment-page-1/#comment-23370</link>
		<dc:creator>danvk.org &#187; Solving Boggle by Taking Option Three</dc:creator>
		<pubDate>Wed, 05 Aug 2009 01:23:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=89#comment-23370</guid>
		<description>[...] fewer points. In a previous post, I estimated that there were 2^69 possible boggle boards. At 10,000 boards/second, this would take 1.9 billion years of compute [...]</description>
		<content:encoded><![CDATA[<p>[...] fewer points. In a previous post, I estimated that there were 2^69 possible boggle boards. At 10,000 boards/second, this would take 1.9 billion years of compute [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: danvk.org &#187; How many Boggle boards are there?</title>
		<link>http://www.danvk.org/wp/2007-02-10/one-last-boggle-boost/comment-page-1/#comment-3725</link>
		<dc:creator>danvk.org &#187; How many Boggle boards are there?</dc:creator>
		<pubDate>Fri, 03 Aug 2007 03:45:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=89#comment-3725</guid>
		<description>[...] Last time, we completed a board solver that could score 10,000 boards per second. So what to do with all that power? One option was to compute statistics on random boards. Another is to hunt for the holy grail of Boggle: the highest possible scoring Boggle board. The next few posts will be devoted to the search for this board. [...]</description>
		<content:encoded><![CDATA[<p>[...] Last time, we completed a board solver that could score 10,000 boards per second. So what to do with all that power? One option was to compute statistics on random boards. Another is to hunt for the holy grail of Boggle: the highest possible scoring Boggle board. The next few posts will be devoted to the search for this board. [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

