Quiz Space

AI: Search Methods for Problem Solving · End Term · 24 Dec 2023 · September 2023 term · Set FDB1

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 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 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,C,D,G

See the whole paperTake it as a mock test

Question 3 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 24 Dec 2023, in the September 2023 term (IIT M DEGREE FN EXAM FDB1 24 Dec 2023). It carries 1 mark.

More questions from this paper

  1. Q1Printed graph sheets (hard copy) will be provided for registered candidates only. ASK FOR PRINTED GRAPH SHEETS 10 PAGES…
  2. Q2SEARCH\ 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 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 part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fi…
  18. Q19RULE BASED EXPERT SYSTEMS\ A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fi…
  19. Q20RULE BASED EXPERT SYSTEMS\ A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fi…
  20. Q21AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  21. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  22. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  23. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. PREDICATES O…
  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…