Baltic Way 2020 · Problem 10
Combinatorics
Alice and Bob are playing hide and seek. Initially, Bob chooses a secret fixed point in the unit square. Then Alice chooses a sequence of points in the plane. After choosing (but before choosing ) for , Bob tells "warmer" if is closer to than , otherwise he says "colder". After Alice has chosen and heard Bob's answer, Alice chooses a final point . Alice wins if the distance is at most , otherwise Bob wins. Show that if , Alice cannot guarantee a win.
When you’re ready
Review material becomes available with the next Daily.
Review
Topics
Pigeonhole and extremal arguments
Solutions
Solution
Let be the set of all points in the square, and for each , let be the set of possible points consistent with everything Bob has said. For each , we then have that is the disjoint union of the two possible values can take for each of Bob's possible answers. Hence one of these must have area , and the other must have area . Suppose now that Alice always receives the answer resulting in the greater half. After receiving answers, then, . If Alice has a winning strategy, there must be a point in so that the circle of radius centered at contains . Hence . It therefore suffices to show that this inequality does not hold for . This follows from the estimates and , meaning that .
Contest context
Results from Baltic Way 2020
10 teams
- Mean score
- 4.4 / 5
- Scores of 4 or 5
- 9 / 10
- Estonia
- 5 / 5
Score distribution
All team scores
| Team | Score |
|---|---|
| Germany | 4 / 5 |
| Norway | 5 / 5 |
| Poland | 5 / 5 |
| Finland | 5 / 5 |
| Latvia | 5 / 5 |
| Estonia | 5 / 5 |
| Denmark | 5 / 5 |
| Sweden | 5 / 5 |
| Lithuania | 0 / 5 |
| Iceland | 5 / 5 |