Question 4
TSP
Answer the given subquestions.
Consider 6 cities A to F, how many tours are represented by the TSP BnB node (S_0, ~AB, ~AC, BE, ~DB, ~DA)? Infer the permanent segments before counting the tours.
Question 4: Consider 6 cities A to F, how many tours are represented …
Show answer
Correct answer: 1
Question 4 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 1 mark.
More questions from this paper
- SEARCH\ 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…
- SEARCH\ 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…
- SEARCH\ 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…
- The TSP BnB procedure will return the optimal tour .
- Let N be the number of cities. For the purpose of analysis, construct a relaxed (version of TSP BnB) tree in the follow…
- Consider the relaxed tree generated in the PREVIOUS question. If we prune all nodes that violate the tour condition, th…
- Identify the horizon nodes pruned by beta-cuts. Enter their node labels in the text box.\ Enter a comma separated list …
- Solve the game tree using SSS algorithm. Identify the SOLVED horizon nodes that are removed from the queue by the pruni…
- What is the horizon effect? Give a concise and clear answer. Stay on point.\ NOTE: Your answer should not exceed 100 wo…
- Can the Forward State Space Planning algorithm discussed in the lecture solve Sussman Anomaly?
- Can the Goal Stack Planning algorithm discussed in the lecture solve Sussman Anomaly?
- What is true about the Goal Stack Planning algorithm? (Note: a unit goal cannot be decomposed into subgoals.)