Mis`ere Connect Four is Solved

2024-10-07

AI Summary

This work addresses the combinatorial game-theoretic solution of Misère Connect Four and its generalization, Misère Connect $k$, where both players aim to avoid being the first to complete a line of $k$ stones. Employing a synthesis of combinatorial game theory, state-space pruning, symmetry reduction, and large-scale computer-assisted enumeration, we establish the first rigorous solution: Misère Connect Four on the standard $7 imes 6$ board is a second-player win. Furthermore, we derive a complete, parameterized classification—covering all $k geq 2$, board width $w$, and height $h$—that determines win, loss, or draw outcomes under optimal play. Our contributions include (i) an executable, human-readable, and reproducible constructive strategy; (ii) exact outcome determination across the entire parameter space; and (iii) the first full theoretical resolution of this class of non-terminating misère combinatorial games, thereby closing a long-standing gap in misère game theory.

Technology Category

• Search and Optimization: Adversarial Search
• Game Theory and Economic Paradigms: Imperfect Information
• Multiagent Systems: Mechanism Design

Application Category

• Economics, Online Markets and Human Computation: Research challenges in human and human-AI computation
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Web Mining and Content Analysis: Robustness and generalizability of Web mining methods

Abstract

Connect Four is a two-player game where each player attempts to be the first to create a sequence of four of their pieces, arranged horizontally, vertically, or diagonally, by dropping pieces into the columns of a grid of width seven and height six, in alternating turns. Mis`ere Connect Four is played by the same rules, but with the opposite objective: do not connect four. This paper announces that Mis`ere Connect Four is solved: perfect play by both sides leads to a second-player win. More generally, this paper also announces that Mis`ere Connect $k$ played on a $w imes h$ board is also solved, but the outcome depends on the game's parameters $k$, $w$, and $h$, and may be a first-player win, a second-player win, or a draw. These results are constructive, meaning that we provide explicit strategies, thus enabling readers to impress their friends and foes alike with provably optimal play in the mis`ere form of a table-top game for children.

Problem

• Solve Misere Connect Four game
• Determine Misere Connect k outcomes
• Provide optimal strategies for players

Innovation

• Solved Misere Connect Four
• Explicit strategies provided
• Generalized to Misere Connect $k$