2020 CAMO Problems/Problem 6
Let be a positive integer. Eric and a squid play a turn-based game on an infinite grid of unit squares. Eric's goal is to capture the squid by moving onto the same square as it.
Initially, all the squares are colored white. The squid begins on an arbitrary square in the grid, and Eric chooses a different square to start on. On the squid's turn, it performs the following action exactly times: it chooses an adjacent unit square that is white, moves onto it, and sprays the previous unit square either black or gray. Once the squid has performed this action times, all squares colored gray are automatically colored white again, and the squid's turn ends. If the squid is ever unable to move, then Eric automatically wins. Moreover, the squid is claustrophobic, so at no point in time is it ever surrounded by a closed loop of black or gray squares. On Eric's turn, he performs the following action at most times: he chooses an adjacent unit square that is white and moves onto it. Note that the squid can trap Eric in a closed region, so that Eric can never win.
Eric wins if he ever occupies the same square as the squid. Suppose the squid has the first turn, and both Eric and the squid play optimally. Both Eric and the squid always know each other's location and the colors of all the squares. Find all positive integers such that Eric can win in finitely many moves.
This problem needs a solution. If you have a solution for it, please help us out by.
|2020 CAMO (Problems • Resources)|
|1 • 2 • 3 • 4 • 5 • 6|
|All CAMO Problems and Solutions|
The problems on this page are copyrighted by the MAC's Christmas Mathematics Competitions.