The ordinary n-in-a-row game is a positional game in which two players alternately claim points in Z2 with the winner being the first player to claim n consecutive points in a line. We consider a variant of the game, suggested by Croft, where the number of points claimed increases by 1 each turn, and so on turn t a player claims t points. Croft asked how long it takes to win this game. We show that, perhaps surprisingly, the time needed to win this game is (1 o(1))n.
展开▼
