Scribd
Upload
38 views1 page

Assignment 2

Uploaded by

daxilo1803
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
38 views1 page

Assignment 2

Uploaded by

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

Fall 2024 CIS 467 Assignment 2

Issued: Tuesday, Sep. 17, 2024, Due: Tuesday, Sep. 24, 2024

Please hand in the hand-written or printed assignments when you attend the class on
Tuesday, Sep. 24, 2024.

1. For the search tree given in the figure below


a. Find the proper mini-max search value for each node. (10 points)
b. Process the tree left-to-right. Indicate the branches that can be pruned by
alpha-beta pruning. (10 points)

2. Find the numerical substitutions that make the following equation hold:

where P, A, G, E are all different single digit number {0, 1, 2, 3, ..., 9}. Obviously, P and E
cannot be 0.
a. Write down the high-order constraints for this equation and the domains of the
carrier digits. (40 points)
b. Draw the search tree that converts the high order constraints to binary
constraints. (40 points)
c. (Extra) Write down a solution. (5 extra points)

You might also like