Login
Sign Up

Artificial Intelligence: Search Methods for Problem Solving Week 7 NPTEL Assignment Answers 2025

By /

NPTEL Artificial Intelligence: Search Methods for Problem Solving Week 7 Assignment Answers 2025

1. Game Theory is concerned with _____________ .

  • improving the techniques of players in individual games
  • how best to plan the first two throws in a javelin throw competition
  • analysing rational behaviour in a scenario of multiple independent agents
  • the science of strategy of independent agents in competitive environments
  • graphics associated with video games
Answer : See Answers

2. The Prisoner’s Dilemma demonstrates that _____________ .

  • there are moral reasons why prisoners do not attempt jailbreak
  • a prisoner cannot decide whether to inform others before jailbreak
  • two agents each acting rationally may end up with less than optimal payoff
  • two accused need to judge how much to trust an accomplice
Answer :

3. The games studied in this course are _____________ .

  • team games
  • two player games
  • zero sum games
  • positive sum games
  • complete information games
  • games with uncertainty
  • games with deterministic moves
  • games with stochastic moves
Answer :

4. Select the correct statements about Alpha-Beta algorithm.

  • Alpha-cut prunes the MAX children of a MIN node
  • Alpha-cut prunes the MIN children of a MAX node
  • Beta-cut prunes the MAX children of a MIN node
  • Beta-cut prunes the MIN children of a MAX node
Answer :

5. In the Alpha-Beta algorithm, list the line numbers where alpha-cutoff and beta-cutoff occur, respectively

Enter the line number of alpha-cutoff followed by beta-cutoff.
Enter the line numbers as a comma separated list.

Answer :

6. Select the correct statements about the SSS* algorithm.

  • SSS* prunes at least as many nodes as Alpha-Beta prunes.
  • SSS* prunes at most as many nodes as Alpha-Beta prunes.
  • SSS* searches for the optimal strategy.
  • SSS* terminates when the root node is solved.
Answer :

7. In the SSS* algorithm, list the line numbers where MIN/MAX nodes are pruned.

Enter the line numbers as a comma separated list in ascending order.

Answer : See Answers

8. Two procedures for constructing game strategies are listed below.

Which of these procedures construct a game strategy for MAX?

  • Construct-Strategy-1
  • Construct-Strategy-2
  • None of the above
Answer :

9. Four two-player game-trees are shown below with some edges highlighted in bold.

Which of these game trees depict a strategy for MAX? The root is MAX in all trees.

  • Game Tree A
  • Game Tree B
  • Game Tree C
  • Game Tree D
Answer :

GROUP 2 :

The figure shows a game tree with evaluations W (win), L (loss) and D (draw) from Max’s perspective. In this game tree the labels P, Q, R, S indicate strategies/moves at the level of root.

10. What is the outcome (W, L or D) of the game when both players play perfectly?

Answer :

11. Which of the moves P, Q, R, S are the best moves for Max?

Answer :

12. Which of the moves P, Q, R, S lead to a draw if both play perfectly after the first move?

Enter a comma separated list of moves in ALPHABETICAL order.

Answer :

GROUP 3 :

The figure shows a 4-ply game tree with evaluation function values at the horizon. The nodes in the horizon are assigned reference numbers A,B,C,…,X. Use these reference numbers when you want to enter a list of nodes. To break-tie use top-down and left-to-right node order. Use this game tree to answer the following questions.

13. What is the MinMax value of the game?

Answer :

14. List the nodes (node reference numbers) in the best strategy.

Enter the reference numbers as a comma separated list in ASCENDING order.

Answer :

15. Change the eval of exactly one horizon node to get a new MiniMax value of 46. Which node will you change and what will be its new eval? choose the smallest integer value possible for the horizon node that you wish to change. If multiple horizon nodes qualify then pick a node of your choice.

Enter a reference number followed by cost as a comma separated list.

Answer : See Answers

16. Change the eval of one horizon node to get a new MiniMax value of 20. Which node will you change and what will be its new eval? Choose the maximum possible eval for the horizon node that you wish to change. If multiple horizon nodes qualify then pick a node of your choice.

Enter a reference number followed by cost as a comma separated list.

Answer :

17. List the horizon nodes pruned by alpha-cuts.

Enter the reference numbers as a comma separated list in ASCENDING order.

Answer :

18. List the horizon nodes pruned by beta-cuts.

Enter the reference numbers as a comma separated list in ASCENDING order.

Answer :

19. List the horizon nodes in the initial clusters formed by SSS*?

Enter the reference numbers as a comma separated list in ASCENDING order.

Answer :

20. What are the horizon nodes that are assigned SOLVED status by SSS*? When the h-values are equal then select the leftmost deeper node in the tree to break the tie.

Enter the node reference numbers as a comma separated list in ASCENDING order.

Answer : See Answers

Related Posts