Question

Consider the game of LUDO . For LUDO answer the
following questions:
I. Model the LUDO game as an adversarial search problem
II. Would you use minimax or expectimax search to solve LUDO? Explain your reasoning
III. What will be the complexity of adversarial search for LUDO?
IV. Draw the search graph of expectimax search for a turn for each player, assuming there are four
players. One is controlled by you.
V. Will it be feasible to do a vanilla search for solving LUDO? Why or why not?
VI. Will you design an optimistic agent or a pessimistic agent for LUDO? explain your reasoning
VII. How would you speed up the decision‐making process of your algorithm? Explain the
improvements you would make and why they will be helpful

Answer 1

Answer:

The answer is number IV. I think it will be the answer.