A reasonably fast boggle solver implemented in ChezScheme.
The key is the dawg data structure, which is like a trie, but with shared subtrees. I was previously using a trie, but the load time was a bit excessive.
- hemlock - data structures
- chez-matchable - convenience