Question: problem 5 let t be a wld game tree and...
Problem 5. Let T be a WLD game tree and assume that every time Louise has a decision
to make in T she has exactly two options, and also assume that none of Richard's choices
can bring the game to a terminal position (so Louise is the only one who ever moves to a
terminal node). Let l be the number of nodes marked L and let n be the total number of
nodes. Prove that n = 3l if Louise makes a choice at the root node, and otherwise n = 3l+1.