# Alphametic Puzzle Solver

An alphametic puzzle (also sometimes known as a cryptarithm) is a type of puzzle where words are put together into an arithmetic formula such that digits can be substituted for the letters to make the formula true. Here are two examples, the first being one of the simplest and the second being probably the best known alphametic puzzle:

```    I       S E N D
+ B B     + M O R E
-----     ---------
I L L     M O N E Y
```

In the first, I = 1, B = 9, and L = 0. There are many more of these puzzles available.

There are two rules that must be followed for solutions:

• The leftmost letter can't be zero in any word.
• There must be a one-to-one mapping between letters and digits. In other words, if you choose the digit 6 for the letter M, then all of the M's in the puzzle must be 6 and no other letter can be a 6.

If you'd like to find some of your own puzzles, try my alphametic generator.

This will only solve addition puzzles, although any number of summands may be used.

What base do you want to solve the puzzle in (10, normally)?

Enter the summand words for the puzzle, one per line:

 Example: SEND MORE
 Enter the sum word: Example: MONEY

406,383 visits (10 today, 48 this week, 73 this since July 3, 1998.

Back to my alphametics index.
Back to my homepage.