Quiz Space

AI: Search Methods for Problem Solving · End Term · 30 Apr 2023 · January 2023 term

Question 7: SEARCH FOR OPTIMAL SOLUTION\ The figure shows a map on a …

Question 7

+1 markWritten answer

SEARCH FOR OPTIMAL SOLUTION
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 and the cost of each edge is 15 units. The MoveGen function returns nodes in alphabetical order. Use Manhattan Distance as the heuristic function. Where necessary, use node labels to break ties.

SEARCH FOR OPTIMAL SOLUTION
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 and the cost of each edge is 15 units. The MoveGen function returns nodes in alphabetical order. Use Manhattan Distance as the heuristic function. Where necessary, use node labels to break ties.
Based on the above data, answer the given subquestions.

What is the path found by A*? 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,F,K,G

Question 7 of 21 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 30 Apr 2023, in the January 2023 term (IIT M DEGREE ET1 EXAM QPE2 S1 30 Apr 2023). It carries 1 mark.

More questions from this paper

  1. Q1SEARCH\ A MoveGen for a state space where S is the start node and G is the goal node is shown in the table. The MoveGen…
  2. Q2TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  3. Q3TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  4. Q4TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  5. Q5TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  6. Q6TSP BnB\ TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree …
  7. Q8SEARCH FOR OPTIMAL SOLUTION\ The figure shows a map on a uniform grid where each tile is 10x10 in size. The start node …
  8. Q9SEARCH FOR OPTIMAL SOLUTION\ The figure shows a map on a uniform grid where each tile is 10x10 in size. The start node …
  9. Q10GAMES\ The figure shows a 3-ply game tree with evaluation function values defined at horizon. The nodes in the horizon …
  10. Q11GAMES\ The figure shows a 3-ply game tree with evaluation function values defined at horizon. The nodes in the horizon …
  11. Q12GAMES\ The figure shows a 3-ply game tree with evaluation function values defined at horizon. The nodes in the horizon …
  12. Q13GAMES\ The figure shows a 3-ply game tree with evaluation function values defined at horizon. The nodes in the horizon …
  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 Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ...…
  17. Q18RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ...…
  18. Q19RULE BASED EXPERT SYSTEMS\ A Rete Net for classification of machines is shown in the figure. The labels A1, A2, A3, ...…
  19. Q20CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…
  20. Q21CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…