5 The local rugby club has challenged the local cricket club to a chess match to raise money for charity. Each of the top three chess players from the rugby club has played 10 chess games against each of the top three chess players from the cricket club. There were no drawn games. The table shows, for each pairing, the number of games won by the player from the rugby club minus the number of games won by the player from the cricket club. This will be called the score; the scores make a zero-sum game.
| Cricket club |
| \cline { 2 - 5 }\cline { 2 - 5 } | | Doug | Euan | Fiona |
| \cline { 2 - 5 }
Sanjeev | 0 | 4 | - 2 | |
| \cline { 2 - 5 }
Rugby club | Tom | - 4 | 2 | - 4 |
| \cline { 2 - 5 } | Ursula | 2 | - 6 | 0 |
| \cline { 2 - 5 } | | | | |
| \cline { 2 - 5 } |
- How many of the 10 games between Sanjeev and Doug did Sanjeev win? How many of the 10 games between Sanjeev and Euan did Euan win?
Each club must choose one person to play. They want to choose the person who will optimise the score.
- Find the play-safe choice for each club, showing your working. Explain how you know that the game is not stable.
- Which person should the cricket club choose if they know that the rugby club will play-safe and which person should the rugby club choose if they know that the cricket club will play-safe?
- Explain why the rugby club should not choose Tom. Which player should the cricket club not choose, and why?
The rugby club chooses its player by using random numbers to choose between Sanjeev and Ursula, where the probability of choosing Sanjeev is \(p\) and the probability of choosing Ursula is \(1 - p\).
- Write down an expression for the expected score for the rugby club for each of the two remaining choices that can be made by the cricket club. Calculate the optimal value for \(p\).
Doug is studying AS Mathematics. He removes the row representing Tom and then models the cricket club's problem as the following LP.
$$\begin{array} { l l }
\operatorname { maximise } & M = m - 4
\text { subject to } & m \leqslant 4 x \quad + 6 z
& m \leqslant 2 x + 10 y + 4 z
& x + y + z \leqslant 1
\text { and } & m \geqslant 0 , x \geqslant 0 , y \geqslant 0 , z \geqslant 0
\end{array}$$ - Show how Doug used the values in the table to get the constraints \(m \leqslant 4 x + 6 z\) and \(m \leqslant 2 x + 10 y + 4 z\).
Doug uses the Simplex algorithm to solve the LP problem. His solution has \(x = 0\) and \(y = \frac { 1 } { 6 }\).
- Calculate the optimal value of \(M\).