A cryptarithmetic puzzle replaces letters with digits so an arithmetic statement becomes true. Each letter represents one digit, repeated letters retain their digit, and different letters cannot share a digit. section 3.5
SEND + MORE = MONEY
Line up the words as an addition problem, assign digits to S, E, N, D, M, O, R, and Y, and test whether the resulting numbers satisfy the equation. One solution is 9567 + 1085 = 10652. section 3.5
As a constraint-satisfaction problem, the solver searches assignments incrementally. It rejects duplicate digits, accepts valid partial assignments for continued search, and checks the arithmetic equation once every letter is assigned. section 3.5
A genetic algorithm uses a different representation: array indices stand for digits, while array entries hold letters. Its fitness improves as the numerical difference between the two sides decreases. section 5.5
