Solving Cryptarithmetic Problems With Multithreading & Sequence Validation Algorithm

Cryptarithmetic problems are mathematical equations of unknown numbers  that are represented by letters.  The goal  is to identify the number that represents each letter.  These mathematical equations are usually arithmetic operations.  A simple way to solve such problems is by mean of depth first search (DFS) algorithm which has a big search space even for quite small problems.  We propose a solution to this problem with sequence validation algorithm in parallel with optimization using multithreading technique. In simple words a thread is the smallest unit of processing that can be managed by an operating system.  Therefore, is called multithreading, when dealing with more than one thread simultaneously.  We have develop a program to implement this algorithm using C# and showed that the algorithm reaches a solution, applying sequence validation and multithreading techniques, faster than using single thread.