Tom Magliery's cryptarithm solver.

(see http://it.ncsa.uiuc.edu/~mag/Misc/Cstuff.html )

Quite elegant - generates a custom C program to solve the equation.

This directory also includes his 'prefix encoding' dictionary compaction code.
(note: for reference only; dawg compaction is better for most every
application.  Also makes smaller files)

findwords will print out all the valid subwords of a long word.
This is a linear scan through a wordlist.  Exercise to the reader:
come up with two different algorithms to do this task faster - one
using an anagram dictionary (and avoiding the need to load the
whole dictionary) and the other using a dawg (OK to load the dawg,
it's a lot smaller than the dictionary.  Extra points if you code
the latter without loading everything though, and still manage
to run faster than if you did)

G