{"paper":{"title":"An n-in-a-row Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Joshua Erde","submitted_at":"2012-09-23T23:03:45Z","abstract_excerpt":"The usual $n$-in-a-row game is a positional game in which two player alternately claim points in $\\bb{Z}^2$ 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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5123","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}