Difference between revisions of "1974 USAMO Problems/Problem 4"
(New page: ==Problem== A father, mother and son hold a family tournament, playing a two person board game with no ties. The tournament rules are: (i) The weakest player chooses the first two contest...) |
m (→See also) |
||
| Line 15: | Line 15: | ||
==See also== | ==See also== | ||
| − | {{USAMO box|year=1974|num-b=3| | + | {{USAMO box|year=1974|num-b=3|num-a=5}} |
[[Category:Olympiad Inequality Problems]] | [[Category:Olympiad Inequality Problems]] | ||
Revision as of 16:00, 30 December 2008
Problem
A father, mother and son hold a family tournament, playing a two person board game with no ties. The tournament rules are:
(i) The weakest player chooses the first two contestants.
(ii) The winner of any game plays the next game against the person left out.
(iii) The first person to win two games wins the tournament.
The father is the weakest player, the son the strongest, and it is assumed that any player's probability of winning an individual game from another player does not change during the tournament. Prove that the father's optimal strategy for winning the tournament is to play the first game with his wife.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 1974 USAMO (Problems • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
