# Question

Consider the following procedure for choosing moves in games with chance nodes;

• Generate some die-roll sequences (say, 50) down to a suitable depth (say, 8).

• With known die rolls, the game tree becomes deterministic. For each die-roll sequence, solve the resulting deterministic game tree using alpha—beta.

• Use the results to estimate the value of each move and to choose the best, will this procedure work well? Why (not)?

• Generate some die-roll sequences (say, 50) down to a suitable depth (say, 8).

• With known die rolls, the game tree becomes deterministic. For each die-roll sequence, solve the resulting deterministic game tree using alpha—beta.

• Use the results to estimate the value of each move and to choose the best, will this procedure work well? Why (not)?

## Answer to relevant Questions

Describe or implement state descriptions, move generators, terminal tests, utility functions, and evaluation functions for one or more of the following games: Monopoly, Scrabble, bridge (assuming a given contract), and poker ...Describe how the mini max and alpha—beta algorithms change for two-player, nonzero-sum games in which each player has his or her own utility function. You may assume that each player knows the other’s utility function. ...We have defined four different binary logical connectives.a. Are there any others that might be useful?b. How many binary connectives can there be?c. Why are some of them not very useful?Discuss what is meant by optimal behavior in the wumpus world. Show that our definition of the PL-WUMPUS-AGENT is not optimal, and suggest ways to improve it.Represent the sentence “All Germans speak the same languages” in predicate calculus. Use Speaks (x, 1), meaning that person x speaks language l.Post your question

0