There is an infinite grid. Two players play a game. Player A places two black marbles in consecutive blocks in his turn, and player B places one white marble in any of the squares. Player A wins, if he gets 1000 black marbles together in a line. However, player B does not have any winning combination, that is even if 1000 whites occur in a row, player B does not win. Show that player A always has a winning strategy.
closed as off-topic by 6005, Mark Viola, Clément Guérin, tired, A.P. Nov 4 '15 at 15:05
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – 6005, Mark Viola, Clément Guérin, tired, A.P.