Scribd
Upload
497 views8 pages

Cryptarithmetic Problem in AI

The Cryptarithmetic Problem is a constraint satisfaction problem involving the substitution of digits (0-9) with unique alphabets or symbols to achieve correct arithmetic results. Key rules include unique digit-alphabet mapping, adherence to arithmetic operations, and a maximum of one carry in addition. The problem can be approached from either the left-hand side or right-hand side of the equation.

Uploaded by

student -1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
497 views8 pages

Cryptarithmetic Problem in AI

The Cryptarithmetic Problem is a constraint satisfaction problem involving the substitution of digits (0-9) with unique alphabets or symbols to achieve correct arithmetic results. Key rules include unique digit-alphabet mapping, adherence to arithmetic operations, and a maximum of one carry in addition. The problem can be approached from either the left-hand side or right-hand side of the equation.

Uploaded by

student -1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Cryptarithmetic Problem in AI

Cryptarithmetic Problem is a type of constraint satisfaction problem where the game is about
digits and its unique replacement either with alphabets or other symbols.

In cryptarithmetic problem, the digits (0-9) get substituted by some possible alphabets or
symbols. The task in cryptarithmetic problem is to substitute each digit with an alphabet to get
the result arithmetically correct.

We can perform all the arithmetic operations on a given cryptarithmetic problem.

The rules or constraints on a cryptarithmetic problem are as follows:

 There should be a unique digit to be replaced with a unique alphabet.


 The result should satisfy the predefined arithmetic rules, i.e., 2+2 =4, nothing else.
 Digits should be from 0-9 only.
 There should be only one carry forward, while performing the addition operation on a
problem.
 The problem can be solved from both sides, i.e., lefthand side (L.H.S), or righthand
side (R.H.S)

Example

The maximum highest number =9 ( 9+9=18), The maximum carry is=1

( 9+9+9=27) The max Carry is 2


Adding the same number in 2 times the maximum carry is =1

Instead of E Substitute 1
R=5,H=9, 0=0 5+9+0=14
Maximum carry=1

You might also like