This is my trivial boggle-puzzle solver.  See also ../bsdboggle
if you actually want to play an interactive game...

This version is compatible with my DAWG data structures, built
in ../spell and used in various other games.

boggle.c was the original version which required that the output
be piped through sort|uniq to remove duplicate words.

betterboggle.c now builds the result wordlist internally,
it calculates scores properly according to boggle rules, and
it traverses the dictionary trie in parallel with the optimised
and trimmed depth-first-search of the boggle grid.  All in all,
a much better piece of code.  The only reason I leave the old
one here is to show how little modification was necessary in
order to greatly improve the code.

Having done so, the code from 'betterboggle.c' is reused in
../goetz_boggle as "eval.c", where it is made into a simple
evaluation function for a boggle grid passed to it as a parameter.
../goetz_boggle is a genetic algorithm which generates boggle
grids capable of containing large numbers of words and very high
scores.

Examples of running betterboggle are:

./betterboggle
or
./betterboggle - < test1
or
./betterboggle ekli drlm wnnf acrl

The auxilliary files dyntrie.c and prefix.c *should* be moved
to ../spell/SpellLib - they were only recently rescued from
an old archive and modified to match the newer format of
dawg files.

G