17 Feb 2005
CS 3243 - Constraint Satisfaction
10
Example: Cryptarithmetic
nVariables: F T U W
R O X1 X2 X3
R O X1 X2 X3
nDomains: {0,1,2,3,4,5,6,7,8,9}
nConstraints: Alldiff (F,T,U,W,R,O)
nO + O = R + 10 · X1
nX1 + W + W = U + 10 · X2
nX2 + T + T = O + 10 · X3
nX3 = F, T ≠ 0, F ≠ 0