Q. Apply Alpha Beta pruning on the following game tree. First level is Max.

-9 1 -18 10 -17 1 5 -16 -17 2 -4 8 -1 2 4 3 5 2 9 1

0 -1 1 10 9 1 5 6 7 2 4 8

-1 2 7 9
Q. Suppose you have three data points (x1,, x2, x3 ,r), e.g., (1, 2,3, 4), (3, 1, 3, 4), (3, 2, 3, 4), your linear
n
model is y = w0 + w1x1 + w2x2 , population size is 2 and evaluation function is ∑ ( r i− y i ) . You are
2

i
required to execute two iterations of Genetic Algorithms using mutation. Please note that “r” is actual
answer and “y” is predicted answer.

Q. Given an initial state of a 8-puzzle problem and final state to be reached-

 

 
Find the most cost-effective path to reach the final state from initial state using A* Algorithm.
Consider g(n) = Depth of node and h(n) = Number of misplaced tiles.
Q. Convert the following graph into tree, and run Beam Search Algorithm and Branch and Bound
Algorithm.