Quiz Space

AI: Search Methods for Problem Solving · End Term · 3 Sept 2023 · May 2023 term · Set QPE1-S1

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

Question 3

+1 markWritten answer

SEARCH
The figure shows a map on a uniform grid where each tile is 10x10 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 A* 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

Show answer

Correct answer: S,B,E,G

Question 3 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 3 Sept 2023, in the May 2023 term (IIT M DEGREE ET1 EXAM QPE1 S2 03 Sep). It carries 1 mark.

More questions from this paper

  1. Q1SEARCH\ 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…
  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. 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…
  4. 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…
  5. Q6TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  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. Q10GAMES\ The figure shows a game tree with evaluation function values at the horizon nodes.\ The horizon nodes are labele…
  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. Q14PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  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. Q17RULE BASED EXPERT SYSTEMS\ A small part of the Rete Net for classifying resistors is shown in the figure. The labels A1…
  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. Q20AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Consider the…
  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. Q24CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…
  24. Q25CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…