Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 12 Apr 2026 · January 2026 term

Question 8: SEARCH The figure shows a map on a grid where each tile i…

Question 8

+1 markOne correct option

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.

Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.

SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start no

A* algorithm calls MoveGen function, then drops neighbours already present in either OPEN or CLOSED, only then adds remaining neighbours to OPEN.

  1. A

    True

  2. B

    False

Show answer

Correct answer

  • B

    False

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 12 Apr 2026, in the January 2026 term (Ai: Search Methods For Problem Solving 07 Apr 26). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start nod…
  3. Q3SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start nod…
  4. Q4SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start nod…
  5. Q5SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start nod…
  6. Q6SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start nod…
  7. Q7SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start nod…
  8. Q9TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances t…
  9. Q10TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances t…
  10. Q11TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances t…
  11. Q12What defines the best strategy for the MAX player?
  12. Q13For the given game tree, list the leaf nodes in the best strategy. Enter the node labels as a comma separated list in A…
  13. Q14List the leaf nodes pruned by Alpha-Beta algorithm. Enter the node labels as a comma separated list in ASCENDING order.…
  14. Q15Solve the game tree using SSS algorithm. List the leaf nodes (that are not in the initial cluster) that are assigned SO…
  15. Q16Alpha value is refined by Alpha-Beta algorithm whenever .
  16. Q17AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain descri…
  17. Q18AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain descri…
  18. Q19AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain descri…
  19. Q20AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain descri…
  20. Q21AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain descri…
  21. Q22SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start nod…
  22. Q23TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances t…
  23. Q24GAMES Based on the above data, answer the given subquestions.
  24. Q25AUTOMATED PLANNING The domain description of Blocks World with a one-armed robot is given below. The same domain descri…