Computer and Electrical Engineering, International Conference on (2009)

Dubai, UAE

Dec. 28, 2009 to Dec. 30, 2009

ISBN: 978-0-7695-3925-6

pp: 308-312

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCEE.2009.25

ABSTRACT

Cryptarithmetic is a class of constraint satisfaction problems which includes making mathematical relations between meaningful words using simple arithmetic operators like ‘plus’ in a way that the result is conceptually true, and assigning digits to the letters of these words and generating numbers in order to make correct arithmetic operations as well. A simple way to solve such problems is by depth first search (DFS) algorithm which has a big search space even for quite small problems. In this paper we proposed a solution to this problem with genetic algorithm and then optimized it by using parallelism. We also showed that the algorithm reaches a solution faster and in a smaller number of iterations than similar algorithms.

INDEX TERMS

constraint satisfaction, cryptarithmetic, parallel genetic algorithm

CITATION

Reza Abbasian,
Masoud Mazloom,
"Solving Cryptarithmetic Problems Using Parallel Genetic Algorithm",

*Computer and Electrical Engineering, International Conference on*, vol. 01, no. , pp. 308-312, 2009, doi:10.1109/ICCEE.2009.25