Abstract
Verbal arithmetic's is a class of constraint satisfaction problems which includes making mathematical relations between meaningful words using simple arithmetic operators like '+' 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. In this puzzle, arithmetic operations are simple and of base ten, but are ciphered into letters. 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. DFS is an algorithm for searching a tree, tree structure. Thus going deeper and deeper until a goal node is found. The paper illustrates the design and implementation of parallel genetic algorithm that can find the solution more quickly taking less memory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
