Quiz Space

AI: Search Methods for Problem Solving · End Term · 21 Dec 2025 · September 2025 term

Question 6: SEARCH The figure shows a map on a uniform grid where eac…

Question 6

+1 markOne correct option

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.

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

Select the correct statement about the given graph.

  1. A

    Heuristic is admissible.

  2. B

    Heuristic is not admissible.

  3. C

    Heuristic is admissible in some cases and not admissible in other cases.

  4. D

    There is not enough information to determine admissibility.

Show answer

Correct answer

  • B

    Heuristic is not admissible.

See the whole paperTake it as a mock test

Question 6 of 34 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 21 Dec 2025, in the September 2025 term (Ai: Search Methods For Problem Solving 18 Dec 25). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  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 i…
  3. Q3SEARCH 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 i…
  4. 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 i…
  5. 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 i…
  6. Q7Determine the eval of node N that will induce a cutoff to prune its siblings. Enter an even number. NO SPACES, TABS, DO…
  7. Q8What type of cut-off is induced by the eval selected for N?
  8. Q9GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  9. Q10GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  10. Q11PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  11. Q12PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  12. Q13PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  13. Q14RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10…
  14. Q15RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10…
  15. Q16RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10…
  16. Q17Consider actions a and b and two feasible orderings (a then b) and (b then a). Which of the following conditions will p…
  17. Q18In planning graphs constructed by GraphPlan, actions a and b in layer n are mutex .
  18. Q19In planning graphs constructed by GraphPlan, propositions P and Q in layer n are mutex .
  19. Q20AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  20. Q21AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  21. Q22AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  22. Q23AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  23. Q24CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C (processed in that order) with domains and constraints …
  24. Q25CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C (processed in that order) with domains and constraints …
  25. Q26CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C (processed in that order) with domains and constraints …
  26. Q27SEARCH 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 i…
  27. Q28GAMES: ALPHA-BETA Consider a game tree with the root node as MAX. Alpha-Beta algorithm is in mid-flight currently proce…
  28. Q29GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes ar…
  29. Q30PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are unique…
  30. Q31RULE BASED EXPERT SYSTEMS A Rete Net for classification of vehicles is shown in the figure. Labels A1, A2, A3, ..., A10…
  31. Q32AUTOMATED PLANNING 1 Answer the given subquestions.
  32. Q33AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. The GraphPl…
  33. Q34CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C (processed in that order) with domains and constraints …