ECO316H1 Lecture : ch03_solutions_solved edit.doc
Document Summary
There is one initial node (i) for hansel making the first move; three decision nodes (d) S1. including the initial node, which represent the points where either hansel or gretel make a decision; and six terminal nodes (t). (b) There is one initial node (i) for hansel making the first move; four decision nodes (d) including the initial node, which represent the nodes where hansel or gretel make a decision; and nine terminal nodes (t). (c) There is one initial node (i) for hansel making the first move; five decision nodes (d) including the initial node, which represent the nodes where hansel or gretel make a decision; and eight terminal nodes (t). For this question, remember that actions with the same label, if taken at different nodes, are. To clarify the answers, the nodes on the trees are labeled 1, 2, etc. (in addition to showing the name of the player acting there).
