Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 16 Aug 2026 · May 2026 term

Question 9: Solve the game tree using SSS algorithm. Identify the SOL…

Question 9

+2 marksWritten answer

GAMES

Answer the given subquestions.

Solve the game tree using SSS* algorithm. Identify the SOLVED horizon nodes that are removed from the queue by the pruning step. Not popped from the queue but pruned from the queue. Enter the node labels as a comma separated list in ASCENDING order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answers Case Sensitive : No

Show answer

Correct answer: C,I,K

See the whole paperTake it as a mock test

Question 9 of 13 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 16 Aug 2026, in the May 2026 term (Ai: Search Methods For Problem Solving 16 Aug 26). It carries 2 marks.

More questions from this paper

  1. Q1SEARCH\ Consider a state space where each move is reversible and has 6 states (S,A,B,C,D,G) with S as start and G as go…
  2. Q2SEARCH\ Consider a state space where each move is reversible and has 6 states (S,A,B,C,D,G) with S as start and G as go…
  3. Q3SEARCH\ Consider a state space where each move is reversible and has 6 states (S,A,B,C,D,G) with S as start and G as go…
  4. Q4Consider 6 cities A to F, how many tours are represented by the TSP BnB node (S_0, ~AB, ~AC, BE, ~DB, ~DA)? Infer the p…
  5. Q5The TSP BnB procedure will return the optimal tour .
  6. Q6Let N be the number of cities. For the purpose of analysis, construct a relaxed (version of TSP BnB) tree in the follow…
  7. Q7Consider the relaxed tree generated in the PREVIOUS question. If we prune all nodes that violate the tour condition, th…
  8. Q8Identify the horizon nodes pruned by beta-cuts. Enter their node labels in the text box.\ Enter a comma separated list …
  9. Q10What is the horizon effect? Give a concise and clear answer. Stay on point.\ NOTE: Your answer should not exceed 100 wo…
  10. Q11Can the Forward State Space Planning algorithm discussed in the lecture solve Sussman Anomaly?
  11. Q12Can the Goal Stack Planning algorithm discussed in the lecture solve Sussman Anomaly?
  12. Q13What is true about the Goal Stack Planning algorithm? (Note: a unit goal cannot be decomposed into subgoals.)