Misere Connect Four is Solved

TL;DR

Misère Connect Four is solved in this work, showing that the standard $P2$-advantage outcome arises under perfect play and extending the analysis to Misère Connect $k$ on arbitrary $w\times h$ boards. The authors develop parity-based strategies—incl. take-even and delayed take-even—and a finite-state, canonical-board framework that yields constructive, human-implementable play for all parameter regimes considered. Key contributions include exact outcome classifications across board dimensions, rigorous proofs for infinite and narrow cases, and a detailed treatment of the challenging $k=2$ and $h=1$ scenarios. The results deepen understanding of misère play in board games and provide an explicit, strategy-driven path to optimal play, with practical implications for play and further theoretical study.

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. Misere Connect Four is played by the same rules, but with the opposite objective: do not connect four. This paper announces that Misere Connect Four is solved: perfect play by both sides leads to a second-player win. More generally, this paper also announces that Misere Connect $k$ played on a $w \times 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 misere form of a table-top game for children.

Figures (4)

• Figure 1: Illustration of the take-even strategy. (Top-left) In the first move of the game, P1 () must play into row 1. (Top-right) The take-even strategy dictates that P2 () plays in an even row. The existence of this move is guaranteed by P1's play in an odd row. Grey 's indicate the available next moves for P1, all of which are in odd rows. (Bottom-left) An example game state after 25 turns, in which P2 is using the take-even strategy, with P2 to play. (Bottom-right) Example final game state with a P2 win on turn 37. This solution is proved in Theorem \ref{['thm-take-even']}.
• Figure 2: The delayed take-even strategy works by conceptually partitioning the board. The bottom row is counted as "row zero" and the rows above, of which there must be an even number, are called the "even board space."
• Figure 3: Graphical representation of game flow among canonical board types. Board types are vertices and plays are directed edges. The specified moves for (orange) and all possible moves for (blue) have broadly different effects: 's plays move strictly to the right and may create boards that are sometimes dangerous (red), while 's tend to (but do not always) move to the left toward safe boards.
• Figure 4: Representation of game flow among even and odd canonical board types. Board types are vertices and plays are directed edges. The specified moves for (orange) are shown, with annotations for their priority orders among the safe (black) boards. No moves are specified among the dangerous (red) board types because need never play one. All possible moves for (blue) are shown, noting that some moves create two boards and thus follow two edges (e.g. $E_{odd} \ext@arrow 0359\rightarrowfill@{}{O} D_{odd} + B_{odd}$). The five moves (three orange and two blue) that can possibly create dangerous boards are bolded with black outlines. The $E_{even}$ board can never be reached by in-strategy play and is not shown.

Theorems & Definitions (22)

• Theorem 1
• proof
• Corollary 1
• proof
• Theorem 2
• proof
• Corollary 2
• proof
• Theorem 3
• proof