B.E. (CSE), VI Semester Assignment Test-I, March 2021: Instructions To Students
B.E. (CSE), VI Semester Assignment Test-I, March 2021: Instructions To Students
Instructions to Students
1. Total 09 questions are given to each student.
2. Students can either submit a scanned copy of solutions.
3. Write your Roll Number on each page.
4. Last date to upload Assignment-1 is on or before 05-04-2021.
5. Format for uploading the Assignment: rollnum(12 digits)_Assigment1.pdf (ex:160117733168_Assignment1.pdf).
S.No Question Number Roll Numbers
2 In the graph below the start state is S, and the goal state is G. The transition costs are next to the edges, and the heuristic CO2-L5
estimate, h, of the distance from the state to the goal is marked with red color. What is the order of states expanded using A*
search.
3 The following tree represents all possible outcomes of a hypothetical zero-sum game: CO2-L4
This tree is from the perspective of the MAX player; MAX nodes are repesented by squares and MIN nodes by circles. The
leaves of the tree represent the value of the game for the MAX player. The number of each node indicates the order in which
they are considered by the Minimax and α − β pruning algorithms.
(a) Compute the values of each node in the tree using the Minimax strategy, and write these values into the space inside each
node.
(b) Run the α−β pruning algorithm and circle each leaf and node that would NOT be considered by the α−β pruning
algorithm. (Assume that leaves are considered in left-to-right order.)
(c) Write the values of α and β that are passed as arguments to the recursive call at each node in the space provided. The α−β
pruning algorithm is initialized with α = −∞ and β = ∞ at the root node.
4 Solve the following puzzle by assigning numeral (0-9)in such a way that each letter is assigned unique digit which satisfy the CO2-L3
following addition:
a)
b) BASE
+B A L L
GAMES
4.1 CO3-L4
4.2 CO3-L4
4.3 CO3-L4
4.4 CO3-L4
4.5 CO3-L4
4.6 CO3-L4
4.7 CO3-L5