| Exam Board | AQA |
| Module | Further Paper 3 Discrete (Further Paper 3 Discrete) |
| Year | 2021 |
| Session | June |
| Topic | Dynamic Programming |
7 Avon and Roj play a zero-sum game.
The game is represented by the following pay-off matrix for Avon.
7 (c) (i) Find the optimal mixed strategy for Avon.
7 (c) (ii) Find the value of the game for Avon.
7 (d) Roj thinks that his best outcome from the game is to play strategy \(\mathbf { R } _ { \mathbf { 2 } }\) each time.
Avon notices that Roj always plays strategy \(\mathbf { R } _ { \mathbf { 2 } }\) and Avon wants to use this knowledge to maximise his expected pay-off from the game.
Explain how your answer to part (c)(i) should change and find Avon's maximum expected pay-off from the game.
\includegraphics[max width=\textwidth, alt={}, center]{59347089-ea4a-4ee6-b40e-1ab78aa7cdc3-16_2490_1735_219_139}