Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 16 Mar 2025 · January 2025 term

Question 8: SEARCH\ The figure shows a map with several locations on …

Question 8

+1 markOne correct option

SEARCH
The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid points and are connected by two way edges (roads), where each edge has a cost that is the same in both directions. Observe that the edge costs are not necessarily proportional to the coordinate based distance estimates.
The start node is S and the goal node is G, the MoveGen function returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function.
Tie-breaker: when several nodes have the same best cost, use alphabetical order to break ties.

Emulate A*, WA* and Branch-and-Bound on the given map, then answer the subquestions.

Is the heuristic admissible in the given map?

  1. A

    Yes

  2. B

    No

  3. C

    Cannot be determined

Show answer

Correct answer

  • B

    No

See the whole paperTake it as a mock test

Question 8 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 16 Mar 2025, in the January 2025 term (IIT M DEGREE AN EXAM QDB2 16 Mar 2025). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  3. Q3SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  4. Q4SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  5. Q5SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  6. Q6SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  7. Q7SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  8. Q9TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  9. Q10TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  10. Q11TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  11. Q12TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  12. Q13TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  13. Q14GAMES\ The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon…
  14. Q15GAMES\ The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon…
  15. Q16GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  16. Q17GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  17. Q18GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  18. Q19GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  19. Q20AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  20. Q21AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  21. Q22AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  22. Q23AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  23. Q24AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  24. Q25AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…