User:Paolo Liberatore~enwiki/Crypto-arithmetic puzzle
Main space article at: Alphametic
A crypto-arithmetic puzzle is a puzzle made of an equation over two integer expressions in which numbers are replaced by letters; a solution is an assignment of different digits to the letters in such a way the equation holds. A typical example of a crypto-arithmetic puzzle the "send more money" puzzle, invented by Henry Dudeney and published for the first time in the June 1924 issue of the Strand Magazine. This problem is displayed as follows:
S E N D + M O R E ----------- M O N E Y
The only solution of this problem is: S=9 E=5 N=6 D=7 M=1 O=0 R=8 Y=2, as replacing each letter with its corresponding number leads to the following correct equation:
9 5 6 7 + 1 0 8 5 ----------- 1 0 6 5 2
Another common crypto-arithmetic puzzle is GERALD+DONALD=ROBERT. A French version is LIONNE+TIGRE=TIGRON and a German version is WEIN+WEIB=LIEBE. The first of these two puzzles are often used as examples of constraint satisfaction problems or problems that can be solved by constraint programming, often together with the Eight queens puzzle.
References[edit]
- Dechter, Rina (2003). Constraint processing. Morgan Kaufmann. ISBN 1-55860-890-7
- Apt, Krzysztof (2003). Principles of constraint programming. Cambridge University Press. ISBN 0-521-82583-0
- Marriot, Kim (1998). Programming with constraints: An introduction. MIT Press.
{{cite book}}: Unknown parameter|coauthors=ignored (|author=suggested) (help) ISBN 0-262-13341-5