terminal nodes

Write down a function i(*) that maps a player to each non-terminal node of the tree, just as is done in the examples in the handout.

Discussion Prompt In 500 words, write an answer to the following question: Consider the following game: 1 ———^———- A | x0 | B | | 2 3 ———-^— —-^———- C | x1 | D E | x2 | F | | | | x3 1………..1 x6 $1 ——-^– –^——– $1 $1 G | x4 | […]

Scroll to top