A brute-force solver for alphametics and constraint puzzles. Set each letter's range
(min / max) and whether its value must be unique, then enter one expression per line
(e.g. SEND+MORE==MONEY). It searches for value assignments that satisfy
every expression at once.