University of Asia Pacific

Dept. of Computer Science and Engineering

Class Test – 03
Course Code: CSE 403 (B) Course Title: Artificial Intelligence and Expert Systems
Total Marks: 20 Time: 40 (30+10) Mins
Answer the following questions:

1. Define crossover with example. 3

2 Your target is to prune the following game tree in order to improve the searching time efficiency. 17
Which algorithm you think is best for this problem? Consider the values of the terminal nodes are
as follows:

T1 = (Last 2 digits of your id) % 3 + 4 T2 = - {(Last 2 digits of your id) % 4 + 7}

T3 = (Last 2 digits of your id) % 2 + 3 T4 = - {(Last 2 digits of your id) % 7 + 1}
T5 = (Last 2 digits of your id) % 6 + 1 T6 = (Last 2 digits of your id) % 5 + 2
T7 = - {(Last 2 digits of your id) % 2+ 5} T8 = - {(Last 2 digits of your id) % 8 + 1}
T9 = (T5 + 1)

In this game tree,

Max

Min

Terminal State