NobleBlocks
Public

An Efficient Parallel Algorithm for Solving Cryptarithmetic Problems: PGA

Published • Jan 1, 2009
NobleIDNI3P23W53R56S21
Authors:
Ali Rahnavard
,
Gholamhossein Dastghaibyfard

Abstract

Parallel implementations of genetic algorithms are very performable to solve large scale problems. Cryptarithmetic is a constraint satisfaction problem which includes assigning digits to letters in order to make meaningful and correct arithmetic operations. In this puzzle, arithmetic operations are ...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!