Quiz Space

AI: Search Methods for Problem Solving · End Term · 22 Dec 2024 · September 2024 term · Set QDB3

Question 2: SEARCH\ The figure shows a map on a uniform grid where ea…

Question 2

+1 markWritten answer

SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.

Based on the above data, answer the given subquestions.

What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: S,X,Y,Z,G

Show answer

Correct answer: S,D,A,G

Question 2 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 22 Dec 2024, in the September 2024 term (IIT M DEGREE AN EXAM QDB3 22 Dec 2024). It carries 1 mark.

More questions from this paper

  1. Q1ASK FOR PRINTED GRAPH SHEETS 10 PAGES DOUBLE-SIDED PRINT
  2. Q3SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  3. Q4SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  4. Q5SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  5. Q6SEARCH\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node…
  6. Q7TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  7. Q8TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  8. Q9TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  9. Q10TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  10. Q11GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  11. Q12GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  12. Q13GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  13. Q14GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  14. Q15AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. This is the …
  15. Q16AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. This is the …
  16. Q17AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. This is the …
  17. Q18AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. This is the …
  18. Q19PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  19. Q20PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  20. Q21PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  21. Q22RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  22. Q23RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  23. Q24RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of properties is shown in the figure. The labels A1, A2, A3, .…
  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…