These puzzles were inspired by a squash match I watched earlier today. It was a best of five match and the Magdalene player was winning; two games to one. The opposition player put most of his remaining “energy” into winning the fourth game. In the event he put so much into winning that game that he was knackered by the time he got to starting the fifth (which the Magdalene Player won easily). The question occured to me as to how hard each player should be trying, how much of the kitchen sink to throw into the match and how much to keep in reserve for the possible fifth game (?).
A more well defined problem is this:
Two players are both given £100.00 to use in wining a contest which is conducted as follows: In the first round each player must pay as much or as little of his money into a box (unseen by his opponent) as he wishes to. The boxes are then examined by the umpire who awards a point to whoever paid the most money (ties are scored as half a point each). With whatever money each opponent has left a second round is conducted in the same way. Finally a third round is conducted in which both players will place all their remaining money into a third and final box. The winner of the third round is decided in the same way.
Imagine you are playing this game.
Clearly, since there is symmetry in the game, there can be no strategy that guarantees a win for one or other player.
But is there one which guarantees at least a draw?
Assuming the answer to this question is no (which I feel would not be hard to prove), is there an optimal (most likely probabilistic rather than deterministic) strategy that maximises the chance of winning the contest? (Strictly I would want to maximise the expected outcome of the contest for the player employing the strategy. A drawn overall outcome would count as half a win)
Clearly if the above strategy exists it will have an expected outcome of 0.5 or better against all other strategys including itself (against which it would score, on average, 0.5).
Problem:
Find such a strategy or prove that one does not exist!
For all I know these two problems might be among the hardest in Mathematics or they might have relatively simple solutions. (This is especially likely if the answer is that such a strategy can be proved not to exist which I think is likely to be the answer).
Finally, and I think more easily, if you could cheat by bringing extra money into the game how much extra money would you need, with a good strategy, to guarantee that you win the contest?
For this one can you think of a good bound and accompanying strategy?
Recent Comments