<?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: Breaking 3&#215;3 Boggle</title>
	<atom:link href="http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/</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: kundan singh</title>
		<link>http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-24738</link>
		<dc:creator>kundan singh</dc:creator>
		<pubDate>Tue, 22 Sep 2009 07:41:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=516#comment-24738</guid>
		<description>there are five vowels in english gramer. so you can make a word.without any allphabets to taken out side. please sort-out my problum.



thanking you</description>
		<content:encoded><![CDATA[<p>there are five vowels in english gramer. so you can make a word.without any allphabets to taken out side. please sort-out my problum.</p>
<p>thanking you</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: HisKingdomComes</title>
		<link>http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-24202</link>
		<dc:creator>HisKingdomComes</dc:creator>
		<pubDate>Mon, 31 Aug 2009 08:32:47 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=516#comment-24202</guid>
		<description>What about using CUDA (or similar) instructions for a GPU and use a couple of computers to just crunch only this task till it&#039;s done? I know a CUDA-enabled GPU could cost you some money, but maybe someone is able to borrow you one.

I like mathematical problem-solvers (as computed) and appreciate the people who figure these things out!

- His Kingdom Comes -</description>
		<content:encoded><![CDATA[<p>What about using CUDA (or similar) instructions for a GPU and use a couple of computers to just crunch only this task till it&#8217;s done? I know a CUDA-enabled GPU could cost you some money, but maybe someone is able to borrow you one.</p>
<p>I like mathematical problem-solvers (as computed) and appreciate the people who figure these things out!</p>
<p>- His Kingdom Comes -</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: danvk</title>
		<link>http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-23870</link>
		<dc:creator>danvk</dc:creator>
		<pubDate>Mon, 17 Aug 2009 20:45:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=516#comment-23870</guid>
		<description>Justin -- took me a bit to find the C source, here it is: http://git.imagine27.com/cgit/boggle/tree/src/c

We&#039;re interested in different sorts of performance. Your link is about scaling up to NxN boards, whereas I&#039;m interested in scoring N 3x3 or 4x4 boards.

Also, it appears the C/Lisp code does not enforce the restriction that each word can only be found once? Fixing that problem isn&#039;t a big deal if you&#039;re solving a single NxN board, but it can be an issue if you&#039;re solving lots of boards. I came up with a somewhat novel solution to this problem, which I discuss in this post: http://www.danvk.org/wp/2007-02-10/one-last-boggle-boost/</description>
		<content:encoded><![CDATA[<p>Justin &#8212; took me a bit to find the C source, here it is: <a href="http://git.imagine27.com/cgit/boggle/tree/src/c" rel="nofollow">http://git.imagine27.com/cgit/boggle/tree/src/c</a></p>
<p>We&#8217;re interested in different sorts of performance. Your link is about scaling up to NxN boards, whereas I&#8217;m interested in scoring N 3&#215;3 or 4&#215;4 boards.</p>
<p>Also, it appears the C/Lisp code does not enforce the restriction that each word can only be found once? Fixing that problem isn&#8217;t a big deal if you&#8217;re solving a single NxN board, but it can be an issue if you&#8217;re solving lots of boards. I came up with a somewhat novel solution to this problem, which I discuss in this post: <a href="http://www.danvk.org/wp/2007-02-10/one-last-boggle-boost/" rel="nofollow">http://www.danvk.org/wp/2007-02-10/one-last-boggle-boost/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Justin Grant</title>
		<link>http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-23835</link>
		<dc:creator>Justin Grant</dc:creator>
		<pubDate>Mon, 17 Aug 2009 10:06:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=516#comment-23835</guid>
		<description>A fast boggle solver in Common Lisp and C.</description>
		<content:encoded><![CDATA[<p>A fast boggle solver in Common Lisp and C.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: danvk</title>
		<link>http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-23550</link>
		<dc:creator>danvk</dc:creator>
		<pubDate>Sun, 09 Aug 2009 20:52:31 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=516#comment-23550</guid>
		<description>You&#039;re right, I should do a follow-up post explaining max/no mark in more detail, since it&#039;s the main, novel idea in this post.</description>
		<content:encoded><![CDATA[<p>You&#8217;re right, I should do a follow-up post explaining max/no mark in more detail, since it&#8217;s the main, novel idea in this post.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig Fratrik</title>
		<link>http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-23546</link>
		<dc:creator>Craig Fratrik</dc:creator>
		<pubDate>Sun, 09 Aug 2009 18:43:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=516#comment-23546</guid>
		<description>I dont&#039; quite understand how the Max/No-Mark evaluation decideds at each cell which letter to use.</description>
		<content:encoded><![CDATA[<p>I dont&#8217; quite understand how the Max/No-Mark evaluation decideds at each cell which letter to use.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

