Question: Consider the following procedure for choosing moves in games with chance nodes: a Generate some die-roll sequences (say, 50) down to a suitable depth (say, 8). e With known die rolls, the game tree becomes deterministic. For each die-roll sequence, solve the resulting deterministic game tree using alpha-beta. a Use the results to estimate the value of each move and to choose the best. Will this procedure work well? Why (not)?