Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 4 Aug 2024 · May 2024 term

Question 16: The figure shows a game tree with evaluations at the hor…

Question 16

+1 markWritten answer

The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (numbers) and node labels (A to P).

Based on the above data, answer the given subquestions.

List the horizon nodes in the best strategy. Enter the node labels.
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

Show answer

Correct answer: A,B,E,F

See the whole paperTake it as a mock test

Question 16 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 4 Aug 2024, in the May 2024 term (IIT M DEGREE AN EXAM QDB2 4 Aug 2024). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  3. Q3The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  4. Q4The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  5. Q5The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  6. Q6The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  7. Q7The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  8. Q8The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  9. Q9The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  10. Q10The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  11. Q11The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  12. Q12The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  13. Q13The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  14. Q14The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon nodes …
  15. Q15The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon nodes …
  16. Q17The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (num…
  17. Q18The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (num…
  18. Q19The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (num…
  19. Q20The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  20. Q21The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  21. Q22The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  22. Q23The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  23. Q24The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  24. Q25The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  25. Q26The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…