An Evolutionary Algorithm to Solve Cryptarithmetic Problem

Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using small space and limited time. The paper illustrates the design and implementation of an efficient evolutionary algorithm that can find the solution more quickly taking less memory. Keywords--Constraint Satisfaction Problem (CSP), Cryptarithm, Cryptarithmetic, Evolutionary Algorithm, Greedy Algorithm, Heuristic.

• Type: Conference
• Year: 2004
• Where: IJIT
• Authors: Abu Sayef Md. Ishaque, Md. Bahlul Haider, Muhammad Al Mahmud Wasid, Shah Mohammed Alaul, Md. Kamrul Hassan, Tanveer Ahsan, Md. Shamsul Alam
• Keywords: Artificial Intelligence, Constraint Satisfaction Problem, Evolutionary Algorithm, IJIT 2004, Satisfaction Problem