Example: Cryptarithmetic Puzzle
The Crypt-Arithmetic problem in Artificial Intelligence is a type of encryption problem in which the
written message in an alphabetical form[ which is easily readable and understandable] is converted into a
numeric form [which is neither easily readable nor understandable].
In simpler words, the crypt-arithmetic problem deals with the converting of the message from the
readable plain text to the non-readable ciphertext.
The constraints which this problem follows during the conversion is as follows:
1. A number 0-9 is assigned to a particular alphabet.
2. Each different alphabet has a unique number.
3. All the same, alphabets have the same numbers.
4. The numbers should satisfy all the operations that any normal number does.[ie 2+2=4]
5. There should be only one carry forward, while performing the addition operation on a problem.
6. The problem can be solved from both sides, i.e., lefthand side (L.H.S), or righthand side (R.H.S)