| Exam Board | AQA |
|---|---|
| Module | Further Paper 3 Discrete (Further Paper 3 Discrete) |
| Year | 2020 |
| Session | June |
| Marks | 10 |
| Paper | Download PDF ↗ |
| Topic | Dynamic Programming |
| Type | Zero-sum game optimal mixed strategy |
| Difficulty | Challenging +1.2 This is a standard Further Maths decision mathematics question on finding optimal mixed strategies in zero-sum games. While it requires knowledge of the minimax/maximin method and solving simultaneous equations for mixed strategies, it follows a well-established algorithmic procedure taught in D1/D2 modules. The multi-step nature and Further Maths content place it above average difficulty, but it's a routine textbook exercise rather than requiring novel insight. |
| Spec | 7.08a Pay-off matrix: zero-sum games |
8 Daryl and Clare play a zero-sum game.
The game is represented by the following pay-off matrix for Daryl.
Clare
\hfill \mbox{\textit{AQA Further Paper 3 Discrete 2020 Q8 [10]}}