BTechibtechi.in
Loading Loading
Free IIT Madras BS notes, PYQs and mock tests at btechi.in

AI Search · Game trees: Minimax, Alpha-Beta, SSS*

15 questions · 15 marks · 3 papers

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

AI: Search Methods for Problem Solving

Game trees: Minimax, Alpha-Beta, SSS*

Official Paper

Examination Instructions & Guidelines

Solve on notebook/paper first before checking solutions.
MCQ: Exactly 1 option is correct. Negative marking applies.
MSQ: One or more options correct. Select all to score.
Scientific calculator allowed for all calculations.
Official answer key is sealed at the end of this sheet.

End Term · 31 Aug 2025 (FN)End Term

Read the passage below, then answer Q1–Q4
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node, if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q1MSQ1 Mark·Choose all correct options
Asked 2 times Key ↓
Which of the following is a strategy for the MAX player?
1. AD,E,F,G
2. BH,I,J,K
3. CD,E,F
4. DH,I
Q2Short answer1 Mark·Write the answer
Asked 3 times Key ↓
List the leaf nodes in the best strategy for MAX. Enter the node labels in alphabetical order. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Q3Short answer1 Mark·Write the answer
Asked 3 times Key ↓
List the leaf nodes inspected by Alpha-Beta algorithm. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Q4Short answer1 Mark·Write the answer
Asked 3 times Key ↓
List the leaf nodes SOLVED by SSS*. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:

End Term · 31 Aug 2025 (AN)End Term

Read the passage below, then answer Q5–Q8
GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). Tie-breaker:
When several nodes carry the same best cost then select the deepest node,
if tie persists then select the leftmost of the deepest nodes to break the tie.
Based on the above data, answer the given subquestions.
Q5MSQ1 Mark·Choose all correct options
Asked 2 times Key ↓
Which of the following is a strategy for the MAX player?
1. AI,K
2. BE,F,G
3. CE,F
4. DI,J,K
Q6Short answer1 Mark·Write the answer
Asked 3 times Key ↓
List the leaf nodes in the best strategy for MAX. Enter the node labels in alphabetical order. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Q7Short answer1 Mark·Write the answer
Asked 3 times Key ↓
List the leaf nodes inspected by Alpha-Beta algorithm. Enter a comma separated list of node labels in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Q8Short answer1 Mark·Write the answer
Asked 3 times Key ↓
Your answer:

Quiz 2 · 3 Aug 2025 (AN)Quiz 2

Read the passage below, then answer Q9–Q15
GAMES
Based on the above data, answer the given subquestions
Q9Short answer1 Mark·Write the answer
Asked 3 times Key ↓
List the horizon nodes in the best strategy. Enter the node labels as a comma separated list in ASCENDING order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Q10Short answer1 Mark·Write the answer
Asked 3 times Key ↓
List the horizon nodes pruned by Alpha-Beta algorithm. Enter the node labels as a comma separated list in ASCENDING order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Your answer:
Q11Short answer1 Mark·Write the answer
Key ↓
Your answer:
Q12Short answer1 Mark·Write the answer
Asked 3 times Key ↓
Your answer:
Q13MSQ1 Mark·Choose all correct options
Key ↓
Select the correct statements about the Alpha-Beta algorithm.
1. AAlpha-Cut prunes MAX nodes.
2. BAlpha-Cut is made by a MIN node.
3. CBeta-Cut prunes MIN nodes.
4. DBeta-Cut is made by a MAX node.
Q14MCQ1 Mark·Choose one option
Key ↓
Select the condition that triggers an Alpha-Cut.
1. Aeval(child) <= Alpha
2. BAlpha < eval(child) < Beta
3. CBeta <= eval(child)
4. DCannot be determined
Q15MCQ1 Mark·Choose one option
Key ↓
For a 2-ply game tree with branching factor 3, the number of strategies for MAX-player is __________ .
1. A2
2. B3
3. C2^2
4. D2^3
5. E3^2
6. F3^3

Official Key

Master Answer Key & Explanations

Official answer keys from IIT Madras BS past papers. Click any question to review.

Reveal Key

Q1C, D

Q2A,C

Q3A,B,D,H

Q4A,B,D,H / A,D,H,B / D,H,A,B

Q5A, C

Q6A,C,D

Q7A,B,E,I

Q8A,B,E,I / A,E,I,B / I,E,A,B

Q9D,E,F

Q10H,I

Q11A,D,G

Q12E,F

Q13A, B, C, D

Q14A

Q15B

Questions and answer keys are reproduced from the official IIT Madras BS papers. Topics and repeated question types are BTechi’s own grouping. BTechi is not affiliated with IIT Madras.