![]() |
VOOZH | about |
Two players, A and B, each have an infinite number of coins. They are sitting near a perfectly round table and play the following game:
Suggest a strategy such that player A will always win, no matter how player B will play
Step 1: First Move
Player 1 places the first coin at the centre of the table.
👁 coin_1
Step 2: B’s Move
Player 2 places a coin anywhere on the table (e.g., near the boundary).
👁 coin_2
Step 3: Mirror Move
Player 1 responds by placing a coin at the diametrically opposite position, maintaining equal distance from the boundary.
👁 coin_3