Question 15
GAMES
The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon nodes carry evals (W/D/L) and node labels a1, b1, b2, b3, c1, ..., c8, d1, ..., d10, e1, ..., e8.
Based on the above data, answer the given subquestions.
Change the value of only one horizon node such that the outcome of the game changes. Which horizon node will you change and what will be its new value? Enter the label of the horizon node and its new value as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: c9,X