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

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

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

• Use the results to estimate the value of each move and choose the best.

Will this procedure work correctly? Why (not)?