Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 23 Nov 2025 · September 2025 term

Question 7: Which of the following algorithms can be used to find the…

Question 7

+1 markOne correct option

SEARCH METHODS
Based on the above topic, answer the given subquestions.

Which of the following algorithms can be used to find the most expensive path to goal in a state space where every move is reversible and the edge costs are greater than 1?

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B
See the whole paperTake it as a mock test

Question 7 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 23 Nov 2025, in the September 2025 term (IIT M IMPROVEMENT AN EXAM QIA2 23 Nov 2025). It carries 1 mark.

More questions from this paper

  1. Q1Does the Depth First Search algorithm find the path to the goal?
  2. Q2Does the Best-First Search algorithm find the path to the goal?
  3. Q3Does the Branch and Bound algorithm find the path to the goal?
  4. Q4Based on the above data, answer the given subquestions.
  5. Q5Based on the above data, answer the given subquestions.
  6. Q6Is the heuristic admissible in the given state space?
  7. Q8If h(x) and k(x) are admissible then which of the following is/are admissible?
  8. Q9TSP The distance matrix for 5 cities (A to E) and the sorted edge list is provided below. For each city the distances t…
  9. Q10TSP The distance matrix for 5 cities (A to E) and the sorted edge list is provided below. For each city the distances t…
  10. Q11TSP The distance matrix for 5 cities (A to E) and the sorted edge list is provided below. For each city the distances t…
  11. Q12TSP The distance matrix for 5 cities (A to E) and the sorted edge list is provided below. For each city the distances t…
  12. Q13TSP The distance matrix for 5 cities (A to E) and the sorted edge list is provided below. For each city the distances t…
  13. Q14List the horizon nodes in the best strategy for the MAX player.\ Enter node labels as comma separated list in ASCENDING…
  14. Q15Enter the total number of strategies available for the MAX player.\ Enter an integer\ NO SPACES, TABS, DOTS, BRACKETS O…
  15. Q16Of all the strategies available for the MAX player, identify the MAX strategy that is most favorable for the MIN player…
  16. Q17List the horizon nodes pruned by Alpha-Beta algorithm.\ Enter node labels as comma separated list in ASCENDING order.\ …
  17. Q18List the horizon nodes in the initial cluster formed by SSS algorithm. Enter node labels as comma separated list in ASC…
  18. Q19Solve the game tree using SSS algorithm. List the horizon nodes (not in the initial cluster) that are assigned SOLVED s…
  19. Q20Based on the above data, answer the given subquestions.
  20. Q21AUTOMATED PLANNING The domain description of a Blocks World with a single one-armed robot is given below. Note: this is…
  21. Q22AUTOMATED PLANNING The domain description of a Blocks World with a single one-armed robot is given below. Note: this is…
  22. Q23AUTOMATED PLANNING The domain description of a Blocks World with a single one-armed robot is given below. Note: this is…
  23. Q24AUTOMATED PLANNING The domain description of a Blocks World with a single one-armed robot is given below. Note: this is…
  24. Q25AUTOMATED PLANNING The domain description of a Blocks World with a single one-armed robot is given below. Note: this is…