Difference between revisions of "2024 IMO Problems/Problem 5"
Codemaster11 (talk | contribs) |
|||
| Line 17: | Line 17: | ||
==Video Solution== | ==Video Solution== | ||
https://youtu.be/wfQkk9WktGE (including commentary and some fun facts!) | https://youtu.be/wfQkk9WktGE (including commentary and some fun facts!) | ||
| + | |||
| + | ==See Also== | ||
| + | |||
| + | {{IMO box|year=2024|num-b=4|num-a=6}} | ||
Revision as of 12:25, 30 July 2024
Turbo the snail plays a game on a board with 2024 rows and 2023 columns. There are hidden monsters in 2022 of the cells. Initially, Turbo does not know where any of the monsters are, but he knows that there is exactly one monster in each row except the first row and the last row, and that each column contains at most one monster.
Turbo makes a series of attempts to go from the first row to the last row. On each attempt, he chooses to start on any cell in the first row, then repeatedly moves to an adjacent cell sharing a common side. (He is allowed to return to a previously visited cell.) If he reaches a cell with a monster, his attempt ends and he is transported back to the first row to start a new attempt. The monsters do not move, and Turbo remembers whether or not each cell he has visited contains a monster. If he reaches any cell in the last row, his attempt ends and the game is over.
Determine the minimum value of 
for which Turbo has a strategy that guarantees reaching
the last row on the 
attempt or earlier, regardless of the locations of the monsters.
Video Solution
https://youtu.be/wfQkk9WktGE (including commentary and some fun facts!)
See Also
| 2024 IMO (Problems) • Resources | ||
| Preceded by Problem 4 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 6 |
| All IMO Problems and Solutions | ||
