Cryptarithmetic Problem
Cryptarithmetic problem can be solved by using a constraint satisfaction algorithm.'
In this problem goal state is a problem state in which all letters in the problem have been assigned a digit in such a way that all the initial constraints are satisfied.
Problem:
S E N D
+ M O R E
________________
M O N E Y
Solution :
S E N D
(9) (5) (6) (7)
+ M O R E
(1) (0) (8) (5)
________________________
M O N E Y
(1) (0) (6) (5) (2)
S =9 E=5 N=6 D=7 M=1 O=0 R=8 Y=2
Problem 2:
C R O S S
+ R O A D S
___________________
D A N G E R
Solution:
C R O S S
(9) (6) (2) (3) (3)
+ R O A D S
(6) (2) (5) (1) (3)
__________________________
D A N G E R
(1) (5) (8) (7) (4) (6)
C=9 R=6 O=2 S=3 A=5 D=1 N=8 G=7 E= 4
Following rules follow to solve the problem.
1) Values are to be assigned to the letters from 0 to 9.
2) No two letters should have the same value.
3)If the same letters occur more than once, it must be assigned the same digit each time.
4)The sum of the digits must be as shown in the problem.
Hi. I’m Designer of Blog Magic. I’m CEO/Founder of ThemeXpose. I’m Creative Art Director, Web Designer, UI/UX Designer, Interaction Designer, Industrial Designer, Web Developer, Business Enthusiast, StartUp Enthusiast, Speaker, Writer and Photographer. Inspired to make things looks better.
0 comments:
Post a Comment