Quiz Space

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

Question 5: The TSP BnB procedure will return the optimal tour .

Question 5

+2 marksOne correct option

TSP
Answer the given subquestions.

The TSP BnB procedure will return the optimal tour __________ .

  1. A

    even if node refinement step disables segment inferencing

  2. B

    only when node refinement step uses segment inferencing

Show answer

Correct answer

  • A

    even if node refinement step disables segment inferencing

Video solution

The video solution to this question is being recorded and will play here. Until then, the answer key is above.

See the whole paperTake it as a mock test

Question 5 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. Q6Let N be the number of cities. For the purpose of analysis, construct a relaxed (version of TSP BnB) tree in the follow…
  6. Q7Consider the relaxed tree generated in the PREVIOUS question. If we prune all nodes that violate the tour condition, th…
  7. Q8Identify the horizon nodes pruned by beta-cuts. Enter their node labels in the text box.\ Enter a comma separated list …
  8. Q9Solve the game tree using SSS algorithm. Identify the SOLVED horizon nodes that are removed from the queue by the pruni…
  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.)