Page 59 - DCAP506_ARTIFICIAL_INTELLIGENCE
P. 59
Unit 4: Heuristic Search Techniques
The similar process can be repeated further. The problem has to be composed into different Notes
constraints. And each constraints is to be satisfied by guessing the likely digits that the letters
can be assumed that the initial supposition has been already made . Rest of the process is being
revealed in the form of a tree, by means of depth-first search for the clear understandability of
the solution process.
After Step 1 we derive are more conclusion that Y contradiction should generate a Carry. That is
D + 2 > 9
D > 6 (Controduction)
After Step 2, we found that C1 cannot be Zero, Since Y has to a carry to satisfy goal state. From
this step onwards, no need to branch for C1 = 0.
LOVELY PROFESSIONAL UNIVERSITY 53
