Quiz Space

AI: Search Methods for Problem Solving · End Term · 13 Apr 2025 · January 2025 term

Question 8: TSP Branch-and-Bound Which node represents the optimal to…

Question 8

+1 markWritten answer

TSP Branch-and-Bound

Which node represents the optimal tour and what is the cost of the optimal tour? Enter the node reference number and the tour cost in the text box, or enter NIL if it is not possible to determine the optimal tour.
Enter a node reference number followed by tour cost, separated by comma.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: a9,42

Show answer

Correct answer: d3,434

See the whole paperTake it as a mock test

Question 8 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 13 Apr 2025, in the January 2025 term (IIT M IMPROVEMENT AN EXAM QIM3 13 Apr 2025). It carries 1 mark.

More questions from this paper

  1. Q1ASK FOR PRINTED GRAPH SHEETS 16 PAGES DOUBLE-SIDED PRINT
  2. Q2SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  3. Q3SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  4. Q4SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  5. Q5SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  6. Q6SEARCH\ The figure shows a map on a uniform grid where each tile is 10x10 in size.\ The start node is S and the goal no…
  7. Q7TSP Branch-and-Bound In the given search problem, how many nodes were refined in order to discover the optimal tour? En…
  8. Q9TSP Branch-and-Bound Determine the number of cities in the TSP instance. Enter the number of cities in the text box, or…
  9. Q10TSP Branch-and-Bound Start from city A, what is the path representation of the optimal tour? Enter the path\ representa…
  10. Q11GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  11. Q12GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  12. Q13GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  13. Q14GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  14. Q15PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  15. Q16PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  16. Q17PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  17. Q18RULE BASED EXPERT SYSTEMS\ A small part of the Rete Net for classifying resistors is shown in the figure. The labels A1…
  18. Q19RULE BASED EXPERT SYSTEMS\ A small part of the Rete Net for classifying resistors is shown in the figure. The labels A1…
  19. Q20RULE BASED EXPERT SYSTEMS\ A small part of the Rete Net for classifying resistors is shown in the figure. The labels A1…
  20. Q21AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  21. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  22. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  23. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  24. Q25CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…
  25. Q26CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…