Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 1 Dec 2024 · September 2024 term

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

Question 18

+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 initial cluster formed by SSS* 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

Show answer

Correct answer: A,C,I,K

See the whole paperTake it as a mock test

Question 18 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 1 Dec 2024, in the September 2024 term (IIT M DEGREE AN EXAM QDB2 01 Dec 2024). 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. Q15GAMES\ The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon…
  16. Q16The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (num…
  17. Q17The 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. Q20AUTOMATED PANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: this…
  20. Q21AUTOMATED PANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: this…
  21. Q22AUTOMATED PANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: this…
  22. Q23AUTOMATED PANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: this…
  23. Q24AUTOMATED PANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: this…
  24. Q25AUTOMATED PANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: this…