Cryptarithmetic

Cryptarithmetic (also called alphametic or verbal arithmetic) is a type of mathematical puzzle where digits are replaced by letters, and the solver must determine which digit each letter represents to make a valid arithmetic equation. The most famous example is SEND + MORE = MONEY, where each letter stands for a unique digit (0-9). These puzzles combine logical deduction with arithmetic reasoning and often feature words that form a meaningful phrase, adding a layer of linguistic charm.

Rules

1. Each letter in the puzzle represents a single digit (0-9).
2. The same letter always represents the same digit throughout the puzzle.
3. Different letters represent different digits (no two letters share a digit).
4. The leading digit of any number cannot be zero (e.g., in SEND + MORE = MONEY, S and M cannot be 0).
5. The arithmetic equation must be correct when letters are replaced with their corresponding digits.

Classic Example: SEND + MORE = MONEY

`

S E N D

+ M O R E

---------

M O N E Y

`

Solution: S=9, E=5, N=6, D=7, M=1, O=0, R=8, Y=2 → 9567 + 1085 = 10652

Strategies

• Carry Analysis: The leftmost column often reveals carries. In SEND + MORE = MONEY, the M in MONEY must be a carry from the S+M column, so M=1 (the maximum carry from adding two single digits is 1).
• Column-by-Column Deduction: Work through columns from left to right or right to left, considering possible carries from adjacent columns.
• Unique Digits: Since all letters represent different digits, each assignment eliminates that digit from all other letters. Keep track of remaining available digits.
• Zero Restrictions: The leading letter of each number cannot be zero. This immediately constrains certain letters.
• Parity and Modular Arithmetic: The last digit of the sum is determined by the last digits of the addends. This can quickly eliminate possibilities for the rightmost column.
• Trial and Elimination: Start with the most constrained letters (those appearing in multiple columns or in carry-producing positions), assign a value, and check consistency. Backtrack if a contradiction arises.

Cryptarithmetic puzzles have roots stretching back centuries, but the modern form emerged in the early 20th century. The term "cryptarithmie" was coined by Simon Vatriquant in the May 1931 issue of the Belgian puzzle magazine Sphinx. However, similar puzzles had appeared earlier — Henry Dudeney, the prolific English puzzle maker, published letter-substitution arithmetic problems in the Strand Magazine as early as 1924.

The most famous cryptarithmetic puzzle, SEND + MORE = MONEY, was introduced by Henry Dudeney in 1924 in the Strand Magazine. This puzzle has become the canonical example of the genre, appearing in countless puzzle books, computer science textbooks, and mathematical recreation collections. Its elegant solution (with M=1 forced by the carry) makes it an ideal introduction to the solving process.

Cryptarithmetic gained a new audience in the computer science community during the 1960s and 1970s, when it became a standard example for teaching constraint satisfaction problems, backtracking algorithms, and artificial intelligence. The puzzle perfectly illustrates how constraints (each letter maps to a unique digit, the equation must hold, no leading zeros) can be systematically applied to prune a search space. It appears in virtually every AI textbook as an exercise in constraint propagation.

The puzzles continue to be popular in recreational mathematics. Competitions and puzzle magazines regularly feature cryptarithmetic problems, and the format has been extended to include multiplication (e.g., AB x C = DEF), subtraction, and even multi-operation puzzles. The Internet has spawned communities dedicated to creating and solving these puzzles, often seeking examples where the words form humorous or meaningful phrases (like EAT + THAT = APPLE or WRONG + WRONG = RIGHT).