Figure from the original question paper

(A) Printed graph sheets were provided on time.

(B) Printed graph sheets were provided late.

(C) Printed graph sheets were not provided.

(E) I did not use graph sheets.

GAMES Based on the above data, answer the given subquestions. GAMES What defines the best strategy for the MAX player?

(A) It is a strategy for the MAX player.

(B) It yields the best value for the MAX player.

(C) It admits only perfect play.

(D) It always wins the game for the MAX player.

AI Search Methods Quiz 2 PYQ Jan 2026: 12 Apr 2026 · IITM BS

Question 1

+1 markOne or more correct options

Select all that apply.

A
Printed graph sheets were provided on time.
B
Printed graph sheets were provided late.
C
Printed graph sheets were not provided.
D
I used the graph sheets.
E
I did not use graph sheets.

Show answer

Correct answers

A
Printed graph sheets were provided on time.
D
I used the graph sheets.

Question 1 on its own page

Question 2

+1 markWritten answer

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

In the map, S is the first node to be refined, determine the next 3 nodes (from the 2nd to 4th node) refined by A*. Enter the nodes in the order they are refined. Enter a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 2 on its own page

Question 3

+1 markWritten answer

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

What is the final path found by A* ? Enter the path as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,G Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 3 on its own page

Question 4

+1 markWritten answer

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

For w=2, what is the final path found by WA* ? Enter the path as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,G Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 4 on its own page

Question 5

+1 markWritten answer

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

Inscript What is the cost of the path found by Branch-and-Bound algorithm? Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42

Show answer

A written answer, not marked automatically.

Question 5 on its own page

Question 6

+1 markOne or more correct options

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

For the given map, which algorithms find a path that is also an optimal path?

Select all that apply.

A
A*
B
Branch and Bound
C
Breadth First Search
D
Hill Climbing
E
WA* (w=2)

Show answer

Correct answers

B
Branch and Bound
C
Breadth First Search

Question 6 on its own page

Question 7

+1 markOne correct option

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

Is the heuristic admissible?

A
Yes
B
No

Show answer

Correct answer

B
No

Question 7 on its own page

Question 8

+1 markOne correct option

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

A* algorithm calls MoveGen function, then drops neighbours already present in either OPEN or CLOSED, only then adds remaining neighbours to OPEN.

A
True
B
False

Show answer

Correct answer

B
False

Question 8 on its own page

Question 9

+1 markWritten answer

TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances to other cities are listed in ascending order. For example, Column 1 shows the distance from A to D as 14, A to B as 26 and so on.

Note 1: A segment is a two-way edge between a pair of cities. Note 2: In TSP BnB, after adding or dropping a permanent-segment, first, infer new (included/excluded) permanent-segments, then compute the lower bound. Use the above information to answer the sub-questions.

According to the TSP BnB algorithm covered in the lecture, select the first segment XY to refine the root node S0, then compute the lower bound cost of the node (S0, ~XY) that permanently excludes XY. Enter the lower bound cost in the textbox. Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42

Show answer

A written answer, not marked automatically.

Question 9 on its own page

Question 10

+1 markWritten answer

TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances to other cities are listed in ascending order. For example, Column 1 shows the distance from A to D as 14, A to B as 26 and so on.

Note 1: A segment is a two-way edge between a pair of cities. Note 2: In TSP BnB, after adding or dropping a permanent-segment, first, infer new (included/excluded) permanent-segments, then compute the lower bound. Use the above information to answer the sub-questions.

How many tours are represented by the node (S0, BC, AD, BE, ~AB, AF)? Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42

Show answer

A written answer, not marked automatically.

Question 10 on its own page

Question 11

+1 markWritten answer

TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances to other cities are listed in ascending order. For example, Column 1 shows the distance from A to D as 14, A to B as 26 and so on.

Note 1: A segment is a two-way edge between a pair of cities. Note 2: In TSP BnB, after adding or dropping a permanent-segment, first, infer new (included/excluded) permanent-segments, then compute the lower bound. Use the above information to answer the sub-questions.

Infer all the permanently included and permanently excluded segments in the node (S0, BC, AD, BE, ~AB, AF). Enter the total number of permanently included segments followed by the total number of permanently excluded segments as a comma separated list. Enter two natural numbers as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 17,42 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 11 on its own page

Question 12

+1 markOne or more correct options

GAMES

Based on the above data, answer the given subquestions.

What defines the best strategy for the MAX player?

Select all that apply.

A
It is a strategy for the MAX player.
B
It yields the best value for the MAX player.
C
It admits only perfect play.
D
It always wins the game for the MAX player.

Show answer

Correct answers

A
It is a strategy for the MAX player.
B
It yields the best value for the MAX player.
C
It admits only perfect play.

Question 12 on its own page

Question 13

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions.

For the given game tree, list the leaf 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 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 13 on its own page

Question 14

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions.

List the leaf 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 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 14 on its own page

Question 15

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions.

Solve the game tree using SSS* algorithm. List the leaf nodes (that are not in the initial cluster) that are assigned SOLVED status. 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 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 15 on its own page

Question 16

+1 markOne correct option

GAMES

Based on the above data, answer the given subquestions.

Alpha value is refined by Alpha-Beta algorithm whenever __________ .

A
eval(child) <= Alpha
B
Alpha < eval(child) < Beta
C
Beta <= eval(child)
D
Alpha = eval(child) = Beta

Show answer

Correct answer

B
Alpha < eval(child) < Beta

Question 16 on its own page

Question 17

+1 markOne or more correct options

AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments.

Tie-breaker 1: When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. Tie-breaker 2: Treat the goal description, preconditions and effects as lists that are accessed from left to right. Tie-breaker 3: When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain.

Based on the above data, answer the given subquestions.

AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain descri

Which of the following are applicable actions for the given planning problem?

Select all that apply.

A
Pickup(E)
B
Stack(A,B)
C
Stack(B,C)
D
Stack(D,E)
E
Unstack(A,B)
F
Unstack(D,C)

Show answer

Correct answers

A
Pickup(E)
E
Unstack(A,B)
F
Unstack(D,C)

Question 17 on its own page

Question 18

+1 markOne or more correct options

AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments.

Tie-breaker 1: When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. Tie-breaker 2: Treat the goal description, preconditions and effects as lists that are accessed from left to right. Tie-breaker 3: When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain.

Based on the above data, answer the given subquestions.

Which of the following are relevant actions for the given planning problem?

Select all that apply.

A
Pickup(E)
B
Stack(A,B)
C
Stack(B,C)
D
Stack(D,E)
E
Unstack(A,B)
F
Unstack(D,C)

Show answer

Correct answers

B
Stack(A,B)
C
Stack(B,C)
D
Stack(D,E)

Question 18 on its own page

Question 19

+1 markOne correct option

AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments.

Tie-breaker 1: When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. Tie-breaker 2: Treat the goal description, preconditions and effects as lists that are accessed from left to right. Tie-breaker 3: When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain.

Based on the above data, answer the given subquestions.

For the given goal description, as per the tie breaking rules, which of the following is the first action popped out of the stack by Goal Stack Planning?

A
Stack(A,B)
B
Stack(B,C)
C
Stack(D,E)
D
Unstack(A,B)
E
Unstack(D,C)

Show answer

Correct answer

E
Unstack(D,C)

Question 19 on its own page

Question 20

+1 markWritten answer

AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments.

Tie-breaker 1: When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. Tie-breaker 2: Treat the goal description, preconditions and effects as lists that are accessed from left to right. Tie-breaker 3: When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain.

Based on the above data, answer the given subquestions.

For the given goal description, as per the tie breaking rules, Goal Stack Planning will push the goal description (compound goal) to the stack __________ time(s). Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42

Show answer

A written answer, not marked automatically.

Question 20 on its own page

Question 21

+1 markOne correct option

AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments.

Tie-breaker 1: When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. Tie-breaker 2: Treat the goal description, preconditions and effects as lists that are accessed from left to right. Tie-breaker 3: When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain.

Based on the above data, answer the given subquestions.

While working on a new subgoal, if Goal Stack Planning breaks a previously completed subgoal then it will immediately terminate and report failure.

A
True
B
False

Show answer

Correct answer

B
False

Question 21 on its own page

Question 22

+1 markWritten answer

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

Show answer

A written answer, not marked automatically.

Question 22 on its own page

Question 23

+1 markWritten answer

TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances to other cities are listed in ascending order. For example, Column 1 shows the distance from A to D as 14, A to B as 26 and so on.

Note 1: A segment is a two-way edge between a pair of cities. Note 2: In TSP BnB, after adding or dropping a permanent-segment, first, infer new (included/excluded) permanent-segments, then compute the lower bound. Use the above information to answer the sub-questions.

Show answer

A written answer, not marked automatically.

Question 23 on its own page

Question 24

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions.

Show answer

A written answer, not marked automatically.

Question 24 on its own page

Question 25

+1 markWritten answer

AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments.

Tie-breaker 1: When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. Tie-breaker 2: Treat the goal description, preconditions and effects as lists that are accessed from left to right. Tie-breaker 3: When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain.

Based on the above data, answer the given subquestions.

Show answer

A written answer, not marked automatically.

Question 25 on its own page