Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 16 Mar 2025 · January 2025 term

Question 15: GAMES\ The figure shows a game tree with evaluations W (…

Question 15

+1 markWritten answer

GAMES
The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon nodes carry evals (W/D/L) and node labels a1, b1, b2, b3, c1, ..., c8, d1, ..., d10, e1, ..., e8.

Based on the above data, answer the given subquestions.

Change the value of only one horizon node such that the outcome of the game changes. Which horizon node will you change and what will be its new value? Enter the label of the horizon node and its new value as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: c9,X

Show answer

Correct answer: e5,D or e6,D or e5,L or e6,L

Question 15 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 16 Mar 2025, in the January 2025 term (IIT M DEGREE AN EXAM QDB2 16 Mar 2025). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  3. Q3SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  4. Q4SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  5. Q5SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  6. Q6SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  7. Q7SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  8. Q8SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  9. Q9TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  10. Q10TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  11. Q11TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  12. Q12TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  13. Q13TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  14. Q14GAMES\ The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon…
  15. Q16GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  16. Q17GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  17. Q18GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  18. Q19GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  19. Q20AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  20. Q21AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  21. Q22AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  22. Q23AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  23. Q24AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  24. Q25AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…