A Parity Loop Game
Combinatorics · kan | proposed by @kankanbubell
Mar and Bb take turns connecting points on a $2026 \times 2026$ coordinate grid using horizontal or vertical line segments (with Mar going first). These segments must not pass through any other grid points, must not intersect, and each grid point may be connected to at most two segments. A player loses immediately if they form a closed loop that encloses an odd number of grid points; if no such loop is formed and there are no valid moves left, the game ends in a draw. Determine the outcome—whether Mar wins, Bb wins, or the game ends in a draw—assuming both players play optimally.
AMar has a winning strategy.
BBb has a winning strategy.
CThe game is a forced draw.
DThe outcome depends on the parity of the total number of moves played.