Quiz Space

AI: Search Methods for Problem Solving · End Term · 31 Aug 2025 · May 2025 term · Set QDD3

Question 15: GAMES\ The figure shows a game tree with evaluation func…

Question 15

+1 markWritten answer

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.

Show answer

Correct answer: A,B,E,I or A,E,I,B or I,E,A,B

See the whole paperTake it as a mock test

Question 15 of 28 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M DIPLOMA AN EXAM QDD3 31 Aug 2025). It carries 1 mark.

More questions from this paper

  1. Q1ASK FOR PRINTED GRAPH SHEETS Pages 1 to 8
  2. Q2SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  3. Q3SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  4. Q4SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  5. Q5SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  6. Q6SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  7. Q7TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  8. Q8TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  9. Q9TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  10. Q10TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  11. Q11TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  12. Q12GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  13. Q13GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  14. Q14GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  15. Q16PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  16. Q17PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  17. Q18PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  18. Q19RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
  19. Q20RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
  20. Q21RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
  21. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  22. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  23. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  24. Q25AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  25. Q26CONSTRAINT SATISFACTION Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent t…
  26. Q27CONSTRAINT SATISFACTION Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent t…
  27. Q28CONSTRAINT SATISFACTION Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent t…