Solution of a Classical Cryptarithmetic Problem by using parallel genetic algorithm

The term CryptArithm: it is a mathematical puzzle which involves the replacement of digits with alphabets, symbols and letters. The art and science of solving CryptArithms is known as Cryptarithmetic. CryptArithmetic is related to constraint satisfaction problems (CSP) which uses Operators (Arithmetic) e.g +, -, between relevant words to make mathematical relations in a way that final outcome is logically true. It also ensures that the assigning of values every letter of each word and numbers will produce the accurate result. The numbers are assigned in such a way that no letter should have two numbers (0...9), each letter should contain different number from 0 to 9. Solving CryptArithmetic generally includes a mixed approach of derivation and huge possibility tests. This paper is an effort to find a solution of a Classical CryptArithmetic Problem (CAT+RAN=AWAY) which is computationally expensive and time consuming by using parallel genetic algorithm.