An Efficient Parallel Algorithm for Solving Cryptarithmetic Problems: PGA
Ali Rahnavard, Gholamhossein Dastghaibyfard · 2009
Parallel implementations of genetic algorithms are very performable to solve large scale problems. Cryptarithmetic is a constraint satisfaction problem which includes assigning digits to letters in order to make meaningful and correct arithmetic operations. In this puzzle, arithmetic operations are simple and of base ten, but are ciphered into letters. The task is to decipher them. A simple way to solve such problems is by means of depth first search (DFS) algorithm which has a big search space even for quite small problems. This paper is about to enhance the solution presented on an existing paper by applying a parallelization approach on it. The paper also implemented this algorithm using java and showed that the algorithm reaches a solution faster and in a smaller number of iterations than similar algorithms.