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:

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:


Enter the sum word:

Example: MONEY

285,947 visits (53 today, 201 this week, 1,274 this month, 17,297 this year) since July 3, 1998.

Back to my alphametics index.
Back to my homepage.

Copyright 1998 by Truman Collins
For comments, email: Truman Collins (
Most recent update: November 10, 2013