Comments on: Breaking 3×3 Boggle http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/ Keepin' static like wool fabric since 2006 Wed, 08 Oct 2014 14:33:23 +0000 hourly 1 http://wordpress.org/?v=3.9.2 By: kundan singh http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-24738 Tue, 22 Sep 2009 07:41:09 +0000 http://www.danvk.org/wp/?p=516#comment-24738 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

]]> By: HisKingdomComes http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-24202 Mon, 31 Aug 2009 08:32:47 +0000 http://www.danvk.org/wp/?p=516#comment-24202 What about using CUDA (or similar) instructions for a GPU and use a couple of computers to just crunch only this task till it’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 -

]]> By: danvk http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-23870 Mon, 17 Aug 2009 20:45:53 +0000 http://www.danvk.org/wp/?p=516#comment-23870 Justin — took me a bit to find the C source, here it is: http://git.imagine27.com/cgit/boggle/tree/src/c

We’re interested in different sorts of performance. Your link is about scaling up to NxN boards, whereas I’m interested in scoring N 3×3 or 4×4 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’t a big deal if you’re solving a single NxN board, but it can be an issue if you’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/

]]> By: Justin Grant http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-23835 Mon, 17 Aug 2009 10:06:36 +0000 http://www.danvk.org/wp/?p=516#comment-23835 A fast boggle solver in Common Lisp and C.

]]> By: danvk http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-23550 Sun, 09 Aug 2009 20:52:31 +0000 http://www.danvk.org/wp/?p=516#comment-23550 You’re right, I should do a follow-up post explaining max/no mark in more detail, since it’s the main, novel idea in this post.

]]> By: Craig Fratrik http://www.danvk.org/wp/2009-08-08/breaking-3x3-boggle/comment-page-1/#comment-23546 Sun, 09 Aug 2009 18:43:09 +0000 http://www.danvk.org/wp/?p=516#comment-23546 I dont’ quite understand how the Max/No-Mark evaluation decideds at each cell which letter to use.

]]>