Notes, worked examples and practice for this topic are being written by our tutors. The past-paper questions below are ready now: work each one on paper, then open the mark scheme and the examiner's comment.
Tap a question to zoom it. Mark scheme and examiner's comment open under each question.
June 2025 · AS Paper 2 (Decision 2) · Q3(a)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Most learners attempted to find the row maximin and column minimax, although a small number made errors in this process. Having done so, many learners then stated the correct play- safe strategies and, giving a reason, stated that the game is not stable, although some omitted
Key points from the mark scheme and examiner's report
row minima −2, −5, −3 (maximin −2), column maxima 1, 3, 2 (minimax 1)
play safe Layla P, Mohsin X
−2 ≠ 1 so not stable
June 2025 · AS Paper 2 (Decision 2) · Q3(b)(i)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
the play-safe strategies. A significant number of learners either did not attempt part (b) or made an error in their calculations. Most learners were able to write down the correct three probability expressions, although some failed to define their probabilities before doing so. Most then went on to draw a graph of the three lines, although some were poorly drawn with the horizontal axis extending way beyond 1 and one or more lines incorrect. Those learners who drew an accurate graph then attempted to calculate the value of p, although some incorrectly used the intersection of 5p – 4 and 7p – 5 for this. Most then stated the strategy for Layla, using their value of p.
Key points from the mark scheme and examiner's report
half of each row: X −1.5, Y 0.5, Z −1.5
many omitted (b) or slipped
June 2025 · AS Paper 2 (Decision 2) · Q3(b)(ii)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Most learners attempted to find the row maximin and column minimax, although a small number made errors in this process. Having done so, many learners then stated the correct play- safe strategies and, giving a reason, stated that the game is not stable, although some omitted
Key points from the mark scheme and examiner's report
define p = P(Layla plays P)
lines 5p − 4, 3 − 5p, 7p − 5 for 0 ≤ p ≤ 1 only
optimal point is 3 − 5p = 5p − 4 so p = 7/10: P 0.7, Q 0.3
using 5p − 4 and 7p − 5 was a common error
June 2025 · Paper 4D (Decision 2) · Q6(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In part (a) a good number of candidates correctly calculated the row minima and column maxima and identified the maximin and minimax values, before verifying that these were not equal. A small number of candidates made errors, or did not state all five values and were penalised here. In part (b) those candidates who attempted this, generally wrote down or formed
Key points from the mark scheme and examiner's report
row minima −5, −1 so maximin −1
column maxima 4, 1, 3 so minimax 1
−1 ≠ 1 so not stable
all five values must be shown
June 2025 · Paper 4D (Decision 2) · Q6(b)6 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
penalised here. In part (b) those candidates who attempted this, generally wrote down or formed the correct three probability expressions, although some made errors. They then attempted to draw a graph with incorrect scales and drawn without the use of a ruler. Candidates then attempted to find the optimum point, although some incorrectly chose the lowest point of intersection. Most stated the strategy based on their calculated value of p. In part (c) most
Key points from the mark scheme and examiner's report
expected gains 5p − 1, 1 − 3p, 3 − 8p
plot for 0 ≤ p ≤ 1 with a ruler and suitable scale
highest point of the lowest boundary: 1 − 3p = 5p − 1 so p = 1/4
X with probability 1/4, Y 3/4
choosing the lowest intersection was a common error
June 2025 · Paper 4D (Decision 2) · Q6(c)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
intersection. Most stated the strategy based on their calculated value of p. In part (c) most candidates who attempted this, augmented the table by either 5 or 6 and then attempted to form the relevant equations for the tableau. However, some incorrectly used the rows of the table instead of the columns. In part (d) several candidates who attempted this, only calculated one
Key points from the mark scheme and examiner's report
add 5 (or more) to every pay-off
equations from columns: V − 9x − 4y − 9z + r = 0, V − 3x − 6y − 4z + s = 0, V − 8y − 6z + t = 0, x + y + z + u = 1
objective P − V = 0
using rows instead of columns lost marks
June 2025 · Paper 4D (Decision 2) · Q6(d)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
instead of the columns. In part (d) several candidates who attempted this, only calculated one value of V for the 3 x 3 game and were penalised. Candidates must understand that they need to calculate all three values and then choose the lowest of these. Those candidates who did this, struggled to compare their value with the value for 2 x 3 game, typically because they did not subtract 5 or 6 from their value.
Key points from the mark scheme and examiner's report
z = 2/7
substitute into all three expressions and take the least: V = 38/7 augmented so value 3/7
the 2 × 3 game value was 1/4, so 5/28 better
many substituted into one expression only or forgot to subtract the 5
June 2024 · AS Paper 2 (Decision 2) · Q3(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Most candidates attempted to find the row minima and column maxima, although a small number found the row maxima and column minima instead and some candidates made a slip with one of their values. Most correctly stated that the row maximin did not equal the column minimax. Most candidates were able to correctly write down the reduced table, although some failed to transpose or retained Option Y. Many candidates wrote the correct four expressions and attempted to draw the graph, although some failed to use a ruler, or made their graph so small that it was difficult to pick out the correct point of intersection. Some candidates chose the wrong point of intersection and therefore calculated an incorrect probability. Some candidates incorrectly stated Meera’s options as playing X or playing Y instead of X or Z. Many candidates failed to state the correct two options that Haruki should not play.
Key points from the mark scheme and examiner's report
row minima −5, −3, −1, −4 (maximin −1), column maxima 4, 6, 3 (minimax 3)
not equal so not stable
some found row maxima and column minima instead
June 2024 · AS Paper 2 (Decision 2) · Q3(b)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Most candidates attempted to find the row minima and column maxima, although a small number found the row maxima and column minima instead and some candidates made a slip with one of their values. Most correctly stated that the row maximin did not equal the column minimax. Most candidates were able to correctly write down the reduced table, although some failed to transpose or retained Option Y. Many candidates wrote the correct four expressions and attempted to draw the graph, although some failed to use a ruler, or made their graph so small that it was difficult to pick out the correct point of intersection. Some candidates chose the wrong point of intersection and therefore calculated an incorrect probability. Some candidates incorrectly stated Meera’s options as playing X or playing Y instead of X or Z. Many candidates failed to state the correct two options that Haruki should not play.
Key points from the mark scheme and examiner's report
Meera's matrix: negative transpose with only X and Z: X (−4, −1, 1, 4), Z (5, 3, −1, −3)
some did not transpose or kept Y
June 2024 · AS Paper 2 (Decision 2) · Q3(c)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Most candidates attempted to find the row minima and column maxima, although a small number found the row maxima and column minima instead and some candidates made a slip with one of their values. Most correctly stated that the row maximin did not equal the column minimax. Most candidates were able to correctly write down the reduced table, although some failed to transpose or retained Option Y. Many candidates wrote the correct four expressions and attempted to draw the graph, although some failed to use a ruler, or made their graph so small that it was difficult to pick out the correct point of intersection. Some candidates chose the wrong point of intersection and therefore calculated an incorrect probability. Some candidates incorrectly stated Meera’s options as playing X or playing Y instead of X or Z. Many candidates failed to state the correct two options that Haruki should not play.
Key points from the mark scheme and examiner's report
June 2024 · AS Paper 2 (Decision 2) · Q3(d)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
The final part of this question was a good discriminator, as many candidates failed to realise that the value of the game must now be zero and therefore made no progress. Those candidates who did realise the value of game, tried to set up at least one equation in k and solve it, although some made errors when doing so.
Key points from the mark scheme and examiner's report
equal value for both players means value 0
from A's line 5 − 9p = 0 so p = 5/9
then C's line −5k/9 − 4/9 = 0 gives k = −4/5
many did not see the value is 0 and made no progress
June 2024 · Paper 4D (Decision 2) · Q7(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
A significant number of candidates were able to make good progress with this question, with many finding the correct row maximin and column minimax in (a) and stating that they were not equal. However, some candidates made errors, either by finding row maxima and column minima or by failing to show their working. In (b) the majority of candidates were able to
Key points from the mark scheme and examiner's report
row minima −3, −2, −1 so maximin −1
column maxima 4, 3, 6 so minimax 3
−1 ≠ 3 so not stable
June 2024 · Paper 4D (Decision 2) · Q7(b)5 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
A significant number of candidates were able to make good progress with this question, with minima or by failing to show their working. In (b) the majority of candidates were able to augment the matrix correctly and attempted to form inequalities or equation in terms of V, p1. p2 and p3 although some used rows instead of columns. A good number of candidates then correctly set up the initial tableau. In (c), candidates generally wrote down the correct
Key points from the mark scheme and examiner's report
add 3 to every entry
equations from columns: V − 6p1 − 7p2 − 2p3 + r = 0, V − 5p1 − p2 − 6p3 + s = 0, V − 4p2 − 9p3 + t = 0, p1 + p2 + p3 + u = 1
objective row P − V = 0
using rows instead of columns was a common error
June 2024 · Paper 4D (Decision 2) · Q7(c)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
A significant number of candidates were able to make good progress with this question, with correctly set up the initial tableau. In (c), candidates generally wrote down the correct probabilities, with most giving these in context. A good number were then able to correctly calculate the value of the game for B. Part (d) was more challenging and was not attempted by
Key points from the mark scheme and examiner's report
read from the final tableau: R 3/8, S 17/80, T 33/80
value to A = 73/16 − 3 = 25/16 so value to B is −25/16
June 2024 · Paper 4D (Decision 2) · Q7(d)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
A significant number of candidates were able to make good progress with this question, with calculate the value of the game for B. Part (d) was more challenging and was not attempted by some candidates, while others struggled to form a correct set of equations. Those candidates who did form the correct equations generally gave the solution in context.
Key points from the mark scheme and examiner's report
set B's expected losses against each of A's options equal to the game value (73/16 augmented or 25/16 original) with q1 + q2 + q3 = 1
X 1/2, Y 5/16, Z 3/16
often not attempted
June 2023 · AS Paper 2 (Decision 2) · Q3(a)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Part (a) was done very well, with most candidates finding correct row minimum and column maximum values, with very few errors. A small number of candidates failed to either correctly identify the row maximin and column minimax, or to verify that the game was stable with correct justification.
Key points from the mark scheme and examiner's report
row minima −2, −1, 3, 0 (maximin 3), column maxima 3, 5 (minimax 3)
both 3 so stable
value to B is −3 ('lose 3' scores 0)
June 2023 · AS Paper 2 (Decision 2) · Q3(b)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In part (b) the majority of candidates correctly wrote down the pay-off matrix for player B.
Key points from the mark scheme and examiner's report
B's matrix is the negative transpose without S: X (−2, 1, 0), Y (2, −5, −2)
June 2023 · AS Paper 2 (Decision 2) · Q3(c)6 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In part (c) most candidates set up three correct probability expressions (though some had errors when simplifying these expressions) and then most subsequently went on to draw a graph with 3 lines; a few candidates attempted to just solve pairs of simultaneous equations, scoring no marks. It was noted that some graphs: • were poorly drawn without rulers, • went beyond the axes at p < 0 and p > 1, • had uneven or missing scales on the vertical axes, • were so cramped that it was difficult to identify the correct optimum point. Most candidates attempted to solve the pair of equations for which they considered to be their optimal point from their graph. Those that solved the correct pair usually went on to list the correct options for player B (that is, that they should play option X with probability 7 and 10 option Y with probability 3 ) although a number did not state their answer in context. Those 10 candidates who were successful in finding the correct value of p usually went on to correctly state the value of the reduced game to player A in part (d)(i).
Key points from the mark scheme and examiner's report
B's gains 2 − 4p, −5 + 6p, −2 + 2p drawn for 0 ≤ p ≤ 1
including option S scores at most 3 marks
2 − 4p = −5 + 6p gives p = 7/10: X 0.7, Y 0.3
solving pairs of equations without a graph scores 0
June 2023 · AS Paper 2 (Decision 2) · Q3(d)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
state the value of the reduced game to player A in part (d)(i). Very few candidates made any real progress in the remaining parts of (d) indicating that candidates are still unfamiliar with how to solve the game for one player once the solution is known for the other.
Key points from the mark scheme and examiner's report
value to B is −4/5 so value to A is 4/5
T is never played (its line is not at the optimal point)
2q − (1 − q) = 4/5 gives q = 3/5: Q 0.6, R 0.4, never S or T
very few progressed beyond (i)
June 2023 · Paper 4D (Decision 2) · Q8(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Candidates’ attempts at this question gained marks across the full range.. Most candidates attempted to find the row minima and column maxima, although a small number found the row maxima and column minima, and then stated that the row maximin was not equal to the column minimax. Some candidates failed to clearly identify the maximin and minimax values and a few failed to show all the minima and maxima and were penalised. Most candidates realised that Option Q was always better than Option T, but a number failed to use the word dominate in their explanation and were penalised. Some candidates failed to list the three comparative inequalities to justify their explanation. Many candidates correctly augmented the table (either by adding 3 or 4) and attempted to set up the problem by writing down a series of constraints. Some candidates only listed these as inequalities instead of equations. A small number of candidates incorrectly used rows instead of columns to form their constraints. Most candidates wrote down the objective function, but a number omitted to state maximise with this. When writing the probability constraint, a number of candidates incorrectly set this equal to zero. Many candidates attempted to complete the simplex tableau, although some included errors from their earlier working. A very small number of candidates recognised that Option Y dominated Option Z for Player B and reduced the problem further at this stage, before writing down their constraints and completing the tableau. In part d, there were two alternative approaches seen, both of which produced fully correct solutions. Some candidates calculated the value of p3 and then used this to calculate the value of the game by considering all three options for B. Some candidates only used one option for B to obtain a possible value for the game and were penalised here. Candidates then defined probabilities for Player B, setting up and solving these correctly. They then stated the correct strategy for B, although a small number failed to state that B never plays Option Z. With the alternative approach, candidates recognised that Option Y dominated Option Z for B and reduced the problem accordingly. These candidates then defined probabilities for Player B, set up a pair of expressions or equations and solved these. Again, candidates stated the optimum strategy for B.
Key points from the mark scheme and examiner's report
row minima −3, −1, −2, −4 so maximin −1
column maxima 4, 2, 5 so minimax 2
−1 ≠ 2 so not stable
June 2023 · Paper 4D (Decision 2) · Q8(b)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Candidates’ attempts at this question gained marks across the full range.. Most candidates attempted to find the row minima and column maxima, although a small number found the row maxima and column minima, and then stated that the row maximin was not equal to the column minimax. Some candidates failed to clearly identify the maximin and minimax values and a few failed to show all the minima and maxima and were penalised. Most candidates realised that Option Q was always better than Option T, but a number failed to use the word dominate in their explanation and were penalised. Some candidates failed to list the three comparative inequalities to justify their explanation. Many candidates correctly augmented the table (either by adding 3 or 4) and attempted to set up the problem by writing down a series of constraints. Some candidates only listed these as inequalities instead of equations. A small number of candidates incorrectly used rows instead of columns to form their constraints. Most candidates wrote down the objective function, but a number omitted to state maximise with this. When writing the probability constraint, a number of candidates incorrectly set this equal to zero. Many candidates attempted to complete the simplex tableau, although some included errors from their earlier working. A very small number of candidates recognised that Option Y dominated Option Z for Player B and reduced the problem further at this stage, before writing down their constraints and completing the tableau. In part d, there were two alternative approaches seen, both of which produced fully correct solutions. Some candidates calculated the value of p3 and then used this to calculate the value of the game by considering all three options for B. Some candidates only used one option for B to obtain a possible value for the game and were penalised here. Candidates then defined probabilities for Player B, setting up and solving these correctly. They then stated the correct strategy for B, although a small number failed to state that B never plays Option Z. With the alternative approach, candidates recognised that Option Y dominated Option Z for B and reduced the problem accordingly. These candidates then defined probabilities for Player B, set up a pair of expressions or equations and solved these. Again, candidates stated the optimum strategy for B.
Key points from the mark scheme and examiner's report
Q dominates T since −3 > −4, 2 > 0, 5 > 2
must use 'dominates' and give all three inequalities
June 2023 · Paper 4D (Decision 2) · Q8(c)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Candidates’ attempts at this question gained marks across the full range.. Most candidates attempted to find the row minima and column maxima, although a small number found the row maxima and column minima, and then stated that the row maximin was not equal to the column minimax. Some candidates failed to clearly identify the maximin and minimax values and a few failed to show all the minima and maxima and were penalised. Most candidates realised that Option Q was always better than Option T, but a number failed to use the word dominate in their explanation and were penalised. Some candidates failed to list the three comparative inequalities to justify their explanation. Many candidates correctly augmented the table (either by adding 3 or 4) and attempted to set up the problem by writing down a series of constraints. Some candidates only listed these as inequalities instead of equations. A small number of candidates incorrectly used rows instead of columns to form their constraints. Most candidates wrote down the objective function, but a number omitted to state maximise with this. When writing the probability constraint, a number of candidates incorrectly set this equal to zero. Many candidates attempted to complete the simplex tableau, although some included errors from their earlier working. A very small number of candidates recognised that Option Y dominated Option Z for Player B and reduced the problem further at this stage, before writing down their constraints and completing the tableau. In part d, there were two alternative approaches seen, both of which produced fully correct solutions. Some candidates calculated the value of p3 and then used this to calculate the value of the game by considering all three options for B. Some candidates only used one option for B to obtain a possible value for the game and were penalised here. Candidates then defined probabilities for Player B, setting up and solving these correctly. They then stated the correct strategy for B, although a small number failed to state that B never plays Option Z. With the alternative approach, candidates recognised that Option Y dominated Option Z for B and reduced the problem accordingly. These candidates then defined probabilities for Player B, set up a pair of expressions or equations and solved these. Again, candidates stated the optimum strategy for B.
Key points from the mark scheme and examiner's report
delete T, add 3 to make all values non-negative
maximise P = V
V − 5p2 − 7p3 + r = 0, V − 5p1 − 2p2 − p3 + s = 0, V − 8p1 − 3p2 − 2p3 + t = 0 (columns, not rows), p1 + p2 + p3 + u = 1
initial tableau with P − V = 0
June 2023 · Paper 4D (Decision 2) · Q8(d)6 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Candidates’ attempts at this question gained marks across the full range.. Most candidates attempted to find the row minima and column maxima, although a small number found the row maxima and column minima, and then stated that the row maximin was not equal to the column minimax. Some candidates failed to clearly identify the maximin and minimax values and a few failed to show all the minima and maxima and were penalised. Most candidates realised that Option Q was always better than Option T, but a number failed to use the word dominate in their explanation and were penalised. Some candidates failed to list the three comparative inequalities to justify their explanation. Many candidates correctly augmented the table (either by adding 3 or 4) and attempted to set up the problem by writing down a series of constraints. Some candidates only listed these as inequalities instead of equations. A small number of candidates incorrectly used rows instead of columns to form their constraints. Most candidates wrote down the objective function, but a number omitted to state maximise with this. When writing the probability constraint, a number of candidates incorrectly set this equal to zero. Many candidates attempted to complete the simplex tableau, although some included errors from their earlier working. A very small number of candidates recognised that Option Y dominated Option Z for Player B and reduced the problem further at this stage, before writing down their constraints and completing the tableau. In part d, there were two alternative approaches seen, both of which produced fully correct solutions. Some candidates calculated the value of p3 and then used this to calculate the value of the game by considering all three options for B. Some candidates only used one option for B to obtain a possible value for the game and were penalised here. Candidates then defined probabilities for Player B, setting up and solving these correctly. They then stated the correct strategy for B, although a small number failed to state that B never plays Option Z. With the alternative approach, candidates recognised that Option Y dominated Option Z for B and reduced the problem accordingly. These candidates then defined probabilities for Player B, set up a pair of expressions or equations and solved these. Again, candidates stated the optimum strategy for B.
Key points from the mark scheme and examiner's report
p3 = 5/11
V ≤ 35/11 from all three expressions so V = 35/11 (augmented)
equations in q1, q2, q3: X with probability 4/11, Y 7/11, never Z
June 2022 · AS Paper 2 (Decision 2) · Q3(a)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
A fair proportion of candidates demonstrated understanding of the term ‘zero-sum game’ in (a), but some were unable to clearly convey the idea that one player’s losses equal the other player’s gains.
Key points from the mark scheme and examiner's report
one player's gains exactly balance the other's losses
many could not express this clearly
June 2022 · AS Paper 2 (Decision 2) · Q3(b)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Part (b) was done very well, with most candidates finding correct row minimum and column maximum values, with very few errors. A small number of candidates failed to either correctly identify the row maximin and column minimax, or to verify that the game was stable with correct justification.
Key points from the mark scheme and examiner's report
row minima 1, −2, −1, −4 (maximin 1), column maxima 8, 6 (minimax 6)
1 ≠ 6 so not stable
June 2022 · AS Paper 2 (Decision 2) · Q3(c)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In (c) the majority of candidates correctly wrote down the pay-off matrix for June.
Key points from the mark scheme and examiner's report
June's matrix is the negative transpose: rows X (−1, 2, 1, −8) and Y (−4, −6, −5, 4)
June 2022 · AS Paper 2 (Decision 2) · Q3(d)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In (d) most candidates set up four correct probability expressions (though some had errors when simplifying these expressions) and then most subsequently went on to draw a graph with 4 lines; a few candidates attempted to just solve pairs of simultaneous equations, scoring no marks. It was noted that some graphs: • were poorly drawn without rulers, • went beyond the axes at p < 0 and p > 1, • had uneven or missing scales on the vertical axes, • were so cramped that it was difficult to identify the correct optimum point. Most candidates attempted to solve the pair of equations for which they considered to be their optimal point from their graph. Those that solved the correct pair usually went on to list the correct options for June (that is, that they should play option X with probability 8/15 and option Y with probability 7/15) although a number did not state their answer in context or did not define p initially as the probability of June playing option X (and hence 1 – p as the probability of them playing option Y). Those candidates who were successful in finding the correct value of p usually went on to correctly state the value of the game to Terry. Very few candidates made any real progress in (e) indicating that candidates are still unfamiliar
Key points from the mark scheme and examiner's report
define p = P(June plays X)
gains 3p − 4, 8p − 6, 6p − 5, −12p + 4 drawn for 0 ≤ p ≤ 1
3p − 4 = −12p + 4 gives p = 8/15: X 8/15, Y 7/15
value to Terry 2.4
solving pairs of equations without a graph scores 0
June 2022 · AS Paper 2 (Decision 2) · Q3(e)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Very few candidates made any real progress in (e) indicating that candidates are still unfamiliar with how to solve the game for one player once the solution is known for the other.
Key points from the mark scheme and examiner's report
only A and D (the lines meeting at the optimal point) are used: −t − 8(1 − t) = −4t + 4(1 − t) or either equal to −12/5
t = 0.8: A 0.8, D 0.2, never B or C
very few made progress
June 2022 · Paper 4D (Decision 2) · Q7(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Almost all candidates found parts of this question challenging, so that very few gained full marks. In parts (a) and (b) many were unsure how to deal with the unknown k and consequently found incorrect row minima and column maxima, or omitted them altogether. Some gave single values failing to indicate the two possible values. Stating (-4 or k) rather than min(-4, k) and (-2 or k) rather than max(-2, k) were condoned. Most of those candidates who did give the choice of values then failed to fully explain why the play-safe is Q. Many candidates did however give the correct range of values for k. While many candidates realised that Option X is inferior to Option Y (or Z) they either did not use the word dominates or failed to list the three inequalities comparing values in their two options, so few gained both marks in
Key points from the mark scheme and examiner's report
row minima −2, min(k, −4), −3
whichever is the R minimum, −2 is greatest so Q is play-safe
many mishandled k
June 2022 · Paper 4D (Decision 2) · Q7(b)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Almost all candidates found parts of this question challenging, so that very few gained full marks. In parts (a) and (b) many were unsure how to deal with the unknown k and consequently found incorrect row minima and column maxima, or omitted them altogether. Some gave single values failing to indicate the two possible values. Stating (-4 or k) rather than min(-4, k) and (-2 or k) rather than max(-2, k) were condoned. Most of those candidates who did give the choice of values then failed to fully explain why the play-safe is Q. Many candidates did however give the correct range of values for k. While many candidates realised that Option X is inferior to Option Y (or Z) they either did not use the word dominates or failed to list the three inequalities comparing values in their two options, so few gained both marks in
Key points from the mark scheme and examiner's report
column maxima 4, 6, 3, max(k, −2)
Z play-safe so max(k, −2) < 3, i.e. k < 3 (k ≤ 2)
June 2022 · Paper 4D (Decision 2) · Q7(c)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Almost all candidates found parts of this question challenging, so that very few gained full marks. In parts (c). Many candidates then went on to attempt the solution of the problem although some failed to realise that they needed to reduce the matrix by deleting Option X. Most candidates augmented the matrix correctly, in many cases this was implicitly shown by correct coefficients in their V, p equations. Some candidates failed to augment at all, losing at least three marks, and a few incorrectly augmented the matrix by adding 5 instead of 4, losing two marks. A fair proportion of candidates went on to correctly write down their equations in V, p1, p2 and p3 together with slack variables. A number of candidates (often those who had not deleted Option X) failed to write down the probability constraint as an equation. A small number of candidates incorrectly used the rows of the matrix to form their equations instead of the columns. Most candidates who obtained equations then wrote down their initial tableau, although this could contain errors, with the most common being the inclusion of the Option X equation and omission of the probability equation. Some candidates failed to attempt the final part of the question. The first mark
Key points from the mark scheme and examiner's report
Y (or Z) dominates X since −1 < 3, −4 < 5, 3 < 6
must use 'dominates' and give all three inequalities
June 2022 · Paper 4D (Decision 2) · Q7(d)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Almost all candidates found parts of this question challenging, so that very few gained full marks. In parts
Key points from the mark scheme and examiner's report
delete X and add 4: columns (8, 1, 3), (3, 0, 7), (2, k + 4, 1)
V − 8p1 − p2 − 3p3 + r = 0, V − 3p1 − 7p3 + s = 0, V − 2p1 − (k + 4)p2 − p3 + t = 0, p1 + p2 + p3 + u = 1
tableau with P − V = 0
using rows not columns or not deleting X were common errors
June 2022 · Paper 4D (Decision 2) · Q7(e)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Almost all candidates found parts of this question challenging, so that very few gained full marks. In parts the probability equation. Some candidates failed to attempt the final part of the question. The first mark was accessible to many, as it only required the knowledge that the probabilities sum to one. Some stopped here, whilst others either calculated V, or eliminated V from two equations to work out that k was 1, though arithmetic errors cropped up frequently.
Key points from the mark scheme and examiner's report
p3 = 13/37
V = 112/37 from an equation without k
substitute into the k equation: k = 1
Nov 2021 · Paper 4D (Decision 2) · Q7(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
subtract 3 from the LP coefficients: Q row 3, −3, 1
R row −2, 5, −1
forgetting to subtract 3 scores M1 A0
Nov 2021 · Paper 4D (Decision 2) · Q7(b)6 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
expected gains in terms of p1: X 5p1 − 2, Y 5 − 8p1, Z 2p1 − 1 (or +3 versions)
lowest boundary, highest point where Y and Z meet: 2 + 2p1 = 8 − 8p1 so p1 = 0.6
play Q with probability 0.6, R with 0.4
Nov 2021 · Paper 4D (Decision 2) · Q7(c)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
value 2 + 2(0.6) − 3 = 1/5
Nov 2021 · Paper 4D (Decision 2) · Q7(d)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
X is not used at the optimal point so q1 = 0
equate Alexis's expected gains to 1/5 with q2 + q3 = 1: q2 = 1/5, q3 = 4/5
never X, Y with probability 0.2, Z with 0.8
Oct 2020 · AS Paper 2 (Decision 2) · Q3(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
wins sum to 10 and differ by the table value: (i) 4 so A wins 7 (ii) −2 so B wins 6
Oct 2020 · AS Paper 2 (Decision 2) · Q3(b)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
row minima −6, −2, −6 (maximin −2), column maxima 4, 2, 6 (minimax 2)
play safe A Noel, B Qaasim
−2 ≠ 2 so not stable
Oct 2020 · AS Paper 2 (Decision 2) · Q3(c)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
A plays Noel, so B picks Qaasim, gaining 2 rather than 0 (Paul) or −6 (Rashid)
the reason must use the values, not a general statement
Oct 2020 · AS Paper 2 (Decision 2) · Q3(d)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
define q = P(B plays Paul)
B's gains are the negatives of the table: 6 − 10q, 2 − 2q, −2 + 8q
graph for 0 ≤ q ≤ 1 and take the highest point of the lowest boundary
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
R (or T) dominates S since 4 > 2, −3 > −4, 1 > −2
must use the word 'dominate' and show all inequalities
Oct 2020 · Paper 4D (Decision 2) · Q6(b)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
row minima 1, −3, −2 so maximin 1
column maxima 4, 5, 3 so minimax 3
1 ≠ 3 so not stable
Oct 2020 · Paper 4D (Decision 2) · Q6(c)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
V is the minimum expected (augmented) pay-off over B's options, so V ≤ each expression and we maximise that worst case
Oct 2020 · Paper 4D (Decision 2) · Q6(d)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
an inequality (not = 1) is needed so the Simplex algorithm can be applied and pivot to increase P
Oct 2020 · Paper 4D (Decision 2) · Q6(e)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
p2 = 4/11
substitute into all three expressions: V ≤ 56/11, 56/11, 58/11 so V = 56/11
subtract the 3 added: value 23/11
Oct 2020 · Paper 4D (Decision 2) · Q6(f)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Key points from the mark scheme and examiner's report
set expected pay-offs to A for rows Q and R equal to 23/11 with q1 + q2 + q3 = 1: q1 + 5q2 + 3q3 = 23/11, 4q1 − 3q2 + q3 = 23/11
X with probability 8/11, Y 3/11, never Z
June 2019 · AS Paper 2 (Decision 2) · Q4(a)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Part (a)(i) was done very well, with most candidates finding correct row minimum and column maximum values, with very few errors. A small number of candidates failed to either correctly identify the row maximin and column minimax, or state that the game was stable with correct justification. In part (ii) most correctly stated the value of the game to Brendan (B) but unsurprisingly gave the answer as 3 (which was the value to Aljaz (A)).
Key points from the mark scheme and examiner's report
row minima −6, −7, 3 (maximin 3), column maxima 5, 6, 3 (minimax 3)
equal so stable
value to Brendan is −3 (3 was the common wrong answer)
June 2019 · AS Paper 2 (Decision 2) · Q4(b)7 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
In (b) most candidates set up three correct probability expressions (though some had errors when simplifying these expressions) and then most subsequently went on to draw a graph with 3 lines; a few candidates attempted to just solve three pairs of simultaneous equations, scoring no marks. It was noted that some graphs: were poorly drawn without rulers, went beyond the axes at p < 0 and p > 1, had uneven or missing scales on the vertical axes, were so cramped that it was difficult to identify the correct optimum point. Most candidates attempted to solve the pair of equations for which they considered to be their optimal point from their graph. Those that solved the correct pair usually went on to list the correct options for A (that is, that A should play option P with probability 0.6 and option Q with probability 0.4) although a number did not state their answer in context or did not define p initially as the probability of A playing option P (and hence 1 – p as the probability of A playing option Q). Very few candidates could come up with a correct explanation for why B should never play option Y; many candidates gave a response that danced around the correct answer, but examiners were looking for an answer that strictly indicated that the graph indicated that for all value of p Brendan could gain more by playing either option X or Z. The responses to part (d)(i) were very mixed with many candidates failing to explain why q satisfied
Key points from the mark scheme and examiner's report
define p as the probability Aljaz plays P
lines 5 − 11p, 4 − 5p, −7 + 9p drawn for 0 ≤ p ≤ 1
5 − 11p = −7 + 9p gives p = 3/5: P with probability 0.6, Q 0.4
solving pairs of equations without a graph scores 0
June 2019 · AS Paper 2 (Decision 2) · Q4(c)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Part (a)(i) was done very well, with most candidates finding correct row minimum and column maximum values, with very few errors. A small number of candidates failed to either correctly identify the row maximin and column minimax, or state that the game was stable with correct justification. In part (ii) most correctly stated the value of the game to Brendan (B) but unsurprisingly gave the answer as 3 (which was the value to Aljaz (A)). In (b) most candidates set up three correct probability expressions (though some had errors when simplifying these expressions) and then most subsequently went on to draw a graph with 3 lines; a few candidates attempted to just solve three pairs of simultaneous equations, scoring no marks. It was noted that some graphs: were poorly drawn without rulers, went beyond the axes at p < 0 and p > 1, had uneven or missing scales on the vertical axes, were so cramped that it was difficult to identify the correct optimum point. Most candidates attempted to solve the pair of equations for which they considered to be their optimal point from their graph. Those that solved the correct pair usually went on to list the correct options for A (that is, that A should play option P with probability 0.6 and option Q with probability 0.4) although a number did not state their answer in context or did not define p initially as the probability of A playing option P (and hence 1 – p as the probability of A playing option Q). Very few candidates could come up with a correct explanation for why B should never play option Y; many candidates gave a response that danced around the correct answer, but examiners were looking for an answer that strictly indicated that the graph indicated that for all value of p Brendan could gain more by playing either option X or Z. The responses to part (d)(i) were very mixed with many candidates failing to explain why q satisfied the given equation – many simply stated the given equation or derived it without explaining that if A 6 2 1 q q plays option P then B can expect to gain (as the values in the table are the pay-offs 5 11 0.6 1.6 for player A) and the value of the game to player B is which implies that 6 2 1 1.6 q q which leads to the given equation. Many candidates simply stated the value of 1.6 without any indication of where it had come from and therefore did not ‘show it’. Part (d)(ii) was done much better but some candidates are clearly not conversant with certain mathematical command words and many derived the value of q from scratch and did not use the given equation in (d)(i). While many correctly found the value of q as 0.45 many did not give the best strategy for B in context or refer to the fact that B should ‘play’ option X with prob. 0.45 (and option Z with prob. 0.55).
Key points from the mark scheme and examiner's report
from the graph, for every p Brendan does better with X or Z than Y (Z for p ≤ 3/5, X for p > 3/5)
must refer to all values of p
June 2019 · AS Paper 2 (Decision 2) · Q4(d)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
The responses to part (d)(i) were very mixed with many candidates failing to explain why q satisfied the given equation – many simply stated the given equation or derived it without explaining that if A 6 2 1 q q plays option P then B can expect to gain (as the values in the table are the pay-offs 5 11 0.6 1.6 for player A) and the value of the game to player B is which implies that 6 2 1 1.6 q q which leads to the given equation. Many candidates simply stated the value of 1.6 without any indication of where it had come from and therefore did not ‘show it’. Part (d)(ii) was done much better but some candidates are clearly not conversant with certain mathematical command words and many derived the value of q from scratch and did not use the given equation in (d)(i). While many correctly found the value of q as 0.45 many did not give the best strategy for B in context or refer to the fact that B should ‘play’ option X with prob. 0.45 (and option Z with prob. 0.55).
Key points from the mark scheme and examiner's report
B's gain against P is −(−6q + 2(1 − q)) as the table is A's pay-offs
value to B is −(5 − 11(0.6)) = 1.6
must explain where both sides come from
q = 0.45: X with probability 0.45, Z 0.55
June 2019 · Paper 4D (Decision 2) · Q4(a)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question tested a far less familiar area of the specification and as such provided something of a challenge to many candidates. Part (a) was well answered by almost all candidates, as a classic question from the legacy specification this was to be expected. Occasionally, some marks were lost either due to errors in writing down row minima or column maxima or for incomplete conclusions. Very few inverted the question, finding row maxima and column minima. Sometimes, working was incomplete where there were missing row minimums and column maximums. Candidates should be reminded that in order to be using the correct “method” they must show the row minimums and column maximums in full.
Key points from the mark scheme and examiner's report
row minima −2, −4, −1 so maximin −1
column maxima 3, 4, 0 so minimax 0
−1 ≠ 0 so no stable solution
must show all row minima and column maxima
June 2019 · Paper 4D (Decision 2) · Q4(b)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question tested a far less familiar area of the specification and as such provided something of a Part (b) was generally not well answered. The demand of the question was high and required candidates to provide reasons for the steps required to formulate the linear programming problem. The low number of responses that scored the two most challenging marks here demonstrated the difficulty that candidates seem to experience with this type of question. Many candidates were able to spot the required amendments but were unable to articulate the reasons for the changes. A substantial number of candidates were however, able to go on write down the three constraints correctly. There was, nonetheless, a significant minority who failed to adjust the coefficients of the matrix and/or correct the direction of the inequality sign which was costly in terms of the dependency marks that followed later in the question. Unfortunately, if candidates did not correctly amend the constraints, the number of marks available in
Key points from the mark scheme and examiner's report
add at least 4 (e.g. 5) to every pay-off so V is non-negative
inequalities must be V ≤ … since V is the least A can expect
many spotted the changes but could not give reasons
June 2019 · Paper 4D (Decision 2) · Q4(c)3 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question tested a far less familiar area of the specification and as such provided something of a part (c) was limited. It is clear that setting up a simplex tableau is a far less familiar area of the course and is one that a significant minority did not attempt. Of those candidates that did attempt to populate the tableau, a good number scored full marks. Those that lost marks, did so either due to incorrect constraints from earlier in the question or due to slips and misreading of their own handwriting or simply from a lack of understanding of which rows and columns were required. Parts d) and e) were somewhat unfamiliar and ultimately more challenging for many candidates. Whilst some candidates were able to substitute the values for p1, p2 and p3 into the constraints for V quite a significant proportion either did not attempt this part of the question or simply substituted the values into one constraint only. Sometimes, candidates who used the transformed constraints forgot to adjust the value to be correct for the original problem. Part (e) was a good discriminator at the top end. It was,
Key points from the mark scheme and examiner's report
slack variables r, s, t, u
rows V − 8p1 − p2 − 6p3 + r = 0 etc. (adding 5), p1 + p2 + p3 + u = 1, objective row P − V = 0
often not attempted
June 2019 · Paper 4D (Decision 2) · Q4(d)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question tested a far less familiar area of the specification and as such provided something of a an approach involving the value of the game to B taken from the value their obtained in part (d) together with an expression in terms of p from the matrix. The other half found two expressions for the value of the game to B from their reduced matrix, equated them and solved to determine the probability. Some candidates unnecessarily drew graphs to demonstrate the optimality of the value of p they had found. Those that determined the required probability, usually went on to list the correct options for player B although a small number did not state that player B should never play option X. Candidates should be reminded that their final statement should include a strategy for each of the possible options.
Key points from the mark scheme and examiner's report
substitute p values into all three expressions: V = 4.6 for the augmented game, then subtract the 5 added: value −0.4
June 2019 · Paper 4D (Decision 2) · Q4(e)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
This question tested a far less familiar area of the specification and as such provided something of a the value to be correct for the original problem. Part (e) was a good discriminator at the top end. It was, quite frequently not attempted. Of those that did attempt this part of the question, many candidates did not recognise that p2 = 0 meant that a dominance argument then applied for B which ruled out option X. A number of candidates instead tried to set up simultaneous equations in three variables and were then unable to make further progress. For those candidates who did spot the dominance, about half used an approach involving the value of the game to B taken from the value their obtained in part (d) together
Key points from the mark scheme and examiner's report
p2 = 0 so row Q removed and option X is dominated for B
2q = 0.4 or −2q + (1 − q) = 0.4 gives q = 0.2
never X, Y with probability 0.2, Z with 0.8
many missed the dominance and tried three unknowns
June 2018 · AS Paper 2 (Decision 2) · Q2(a)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
While the vast majority of students correctly explained what the term ‘zero-sum game’ meant a number of students got confused and used the term ‘value’ (e.g. the value of the game to both players is zero) in their definition. A minority of students implied that the gains of both players are equal in a zero-sum game. The reminder of this question was in the context of two teams (A and B) taking part in a quiz and it was clear that some students, when faced with a familiar looking question, go straight to answering the parts of the questions without first reading the set-up to the problem. This was clearly evident in
Key points from the mark scheme and examiner's report
gains of one player exactly balance the losses of the other (total is zero)
saying 'the value of the game is zero' or that both players' gains are equal scores 0
June 2018 · AS Paper 2 (Decision 2) · Q2(b)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
(b) as an answer of –7 (rather than 3) was far too common. Students found (c) extremely demanding and very few could explain why subtracting 5 from each value in the table would model the situation as a zero-sum game. Although it was rare to see, those students who used an algebraic approach starting with the assumption that if team A gained x points then team B would gain 10 – x points were nearly always successful.
Key points from the mark scheme and examiner's report
B gains 10 − 7 = 3
−7 was a very common wrong answer from not reading the set-up
June 2018 · AS Paper 2 (Decision 2) · Q2(c)1 mark
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Part (c)(i) was done very well, with students finding correct row minimum and column maximum values, with very few errors. A small number of students failed to either correctly identify the row maximin and column minimax, or state the corresponding play safe strategies. In part (ii) those students that had correctly answered (i) usually went on to state that the game was not stable with correct justification. Some of those who had not identified the maximin and minimax values in (i) did so here. Others made a correct statement about the maximin and minimax but failed to conclude that the game was not stable. A number of students in (d) failed to read the question
Key points from the mark scheme and examiner's report
if A gains x then B gains 10 − x
subtracting 5 gives x − 5 and 5 − x which sum to zero
found extremely demanding, the algebraic route was the successful one
June 2018 · AS Paper 2 (Decision 2) · Q2(d)(i)4 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
to conclude that the game was not stable. A number of students in (d) failed to read the question carefully and instead found the Row minima and Column maxima for the values in the original table and not for the zero-sum game. For these students only one mark was available in (d) although examiners did allow these students to score all the mark in (e) on the follow through.
Key points from the mark scheme and examiner's report
use the zero-sum table: row minima −2, −4, −1 (maximin −1), column maxima 0, 1, 3 (minimax 0)
play safe A Olive, B Paul
not stable as maximin −1 ≠ minimax 0
many used the original table (max 1 mark)
June 2018 · AS Paper 2 (Decision 2) · Q2(e)6 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
examiners did allow these students to score all the mark in (e) on the follow through. In (e) the majority of students set up three correct probability expressions (though some had errors when simplifying these expressions) and then most subsequently went on to draw a graph with 3 lines; a few students attempted to just solve three pairs of simultaneous equations, scoring no marks. It was noted that some graphs: were poorly drawn without rulers, went beyond the axes at p < 0 and p > 1, had uneven or missing scales on the vertical axes, were so cramped that it was difficult to identify the correct optimum point. Most students attempted to solve the pair of equations for which they considered to be their optimal point from their graph. Those that solved the correct pair usually went on to list the correct options for team A (that is, that team A should play Mischa with probability 2/3 and Noel with probability 1/3) although a number did not state their answer in context. Even though most students had the correct value of p in (e) most did not realise that part (f) specifically asked for the expected number of points awarded, per round, for both teams and instead went into ‘auto-pilot’ and simply calculate the value of the zero-sum game for both teams.
Key points from the mark scheme and examiner's report
three expressions p − 1, 5p − 4, 2 − 4p
graph with lines only for 0 ≤ p ≤ 1 and consistent scales
2 − 4p = 5p − 4 gives p = 2/3: Mischa with probability 2/3, Noel 1/3
solving pairs of equations without a graph scores 0
June 2018 · AS Paper 2 (Decision 2) · Q2(f)(i)2 marks
Mark scheme (whole question; this part is marked with the orange bar)
Examiner's comment
Even though most students had the correct value of p in (e) most did not realise that part (f) specifically asked for the expected number of points awarded, per round, for both teams and instead went into ‘auto-pilot’ and simply calculate the value of the zero-sum game for both teams.
Key points from the mark scheme and examiner's report
(i) 13/3 (ii) 10 − 13/3 = 17/3
many just gave the value of the zero-sum game instead of the points awarded
Find an Edexcel Further Maths tutor
Stuck on this? Book a trial lesson with our Further Maths tutor.