CSDL Home I ICCEE 2009 2009 Second International Conference on Computer and Electrical Engineering (ICCEE 2009)
Dec. 28, 2009 to Dec. 30, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCEE.2009.25
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.
constraint satisfaction, cryptarithmetic, parallel genetic algorithm
Reza Abbasian, Masoud Mazloom, "Solving Cryptarithmetic Problems Using Parallel Genetic Algorithm", ICCEE, 2009, 2009 Second International Conference on Computer and Electrical Engineering (ICCEE 2009), 2009 Second International Conference on Computer and Electrical Engineering (ICCEE 2009) 2009, pp. 308-312, doi:10.1109/ICCEE.2009.25