This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 Second International Conference on Computer and Electrical Engineering
Solving Cryptarithmetic Problems Using Parallel Genetic Algorithm
Dubai, UAE
December 28-December 30
ISBN: 978-0-7695-3925-6
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," iccee, vol. 1, pp.308-312, 2009 Second International Conference on Computer and Electrical Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.