Quiz Space

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

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

Question 12

+1 markOne or more correct options

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.

Which of the following is a strategy for the MAX player?

Select all that apply.

  1. A

    D,E,F,G

  2. B

    H,I,J,K

  3. C

    D,E,F

  4. D

    H,I

Show answer

Correct answers

  • C

    D,E,F

  • D

    H,I

See the whole paperTake it as a mock test

Question 12 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. Q1Figure question
  2. Q2What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.\ NO…
  3. Q3NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.\ Answer format: S,X,Y,Z
  4. Q4What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels.\ …
  5. Q5For the given map, which algorithm finds the shortest path from S to G?
  6. Q6Select the correct statement(s) about the given graph.
  7. Q7TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  8. Q8TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  9. Q9TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  10. Q10TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  11. Q11TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  12. Q13GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  13. Q14GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  14. Q15GAMES\ 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. Based on the…
  22. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
  23. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
  24. Q25AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on 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…