Comments

After being introduced to the game of Boggle by my girlfriend (and losing out to her on one too many occasions) I decided that a computerised solver would lend itself naturally to higher scores.

Searching the net I found many such solvers, but only one of them written in Visual Basic. The one written in Visual Basic uses classes extensively and although it's nicely written, it demonstrates the high overheads involved with creating a vast number of objects (ie. It's quite slow).

At the heart of my Boggle solver, is the String Array class. The String Array class comprises of a dynamic array of strings with built-in binary search. This makes for a very fast Boggle solver.

There are two methods you can use to determine the words in a given Boggle board. One method is to recursively walk through the boggle board, testing each combination against a dictionary. The other method is to walk through the dictionary and try to make each given word on the Boggle board.

My Boggle solver uses the first method to create the word list then when you click on a word in the list it will use the second method to determine how that word is made on the Boggle board.

I'm not making the source code available at this stage but you are free to use the program itself.

Downloads

  BoggleSolver.zip - contains: BoggleSolver.exe, BoggleSolver.chm (579 kb)

Links

Steven Hoyt's Boggle Solver (Boggler) written in Visual Basic

An online Boggle Solver by James Cohen

© Copyright Notice

Unless otherwise stated, the code on this site is Copyright to Andrew McMillan. You may use this code in your projects (both commercial and non-commercial) but you are not permitted to republish this code in any form without the Author's prior consent.

The code on this site is supplied "as is" and no claims are made as to its soundness. The Author claims no responsibility for or liability from use of said source code.