1. Other
  2. Other
  3. problem 5 let t be a wld game tree and...

Question: problem 5 let t be a wld game tree and...

Question details

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 Richards 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 = 31 if Louise makes a choice at the root node, and otherwise n = 31+1.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution