Is Dots and Boxes a Solved Game? What We Actually Know
Small dots and boxes boards have been exhaustively analyzed by computer search and combinatorial theory. Larger boards haven't — and probably won't be anytime soon. Here's the honest state of the research.
"Solved" is a specific technical claim, and it gets thrown around loosely enough in casual conversation about games that it's worth being precise about what it actually means before asking whether it applies to dots and boxes. A solved game is one where perfect play has been determined for every reachable position — not just strong play, but provably optimal play, verified rather than estimated. Checkers is solved. Connect Four is solved. Chess and Go are not, despite superhuman engines existing for both.
Dots and boxes sits in an interesting middle position, and the honest answer to "is it solved" depends entirely on which board size you're asking about.
Small boards: genuinely solved
For small boards — the kind small enough that the total number of possible games is within reach of exhaustive computer search — dots and boxes has been fully analyzed. Every position, every possible line of play, has been examined, and the game-theoretic value of the starting position (who wins with perfect play, and by how much) is known with certainty rather than estimated. This is the strict technical definition of "solved," and it genuinely applies at the small end of the size spectrum.
This kind of exhaustive analysis is what Elwyn Berlekamp's foundational work on the game made tractable in the first place — dots and boxes isn't a simple game to brute-force analyze even at modest sizes, because the "take another turn on completing a box" rule breaks the clean symmetry that normal-play combinatorial game theory usually relies on. Berlekamp and others developed specialized theory — sometimes described in terms of "strings and coins" — specifically to make small boards analyzable at all, well before raw computing power alone could have done it.
Why bigger boards resist the same treatment
The number of legal positions in dots and boxes grows explosively with board size — every additional row and column multiplies the space of possible line-drawing sequences, not just adds to it. This is the same combinatorial explosion problem that keeps chess and Go unsolved despite decades of engine development: the position space isn't just large, it's large in a way that outpaces any foreseeable increase in computing power, because the growth is exponential in the board's dimensions.
Standard board sizes played casually and competitively — the sizes covered in grid size strategy — are almost certainly well beyond what exhaustive analysis can currently reach, and likely will remain so for the foreseeable future. This doesn't mean nothing is known about them — far from it — it means what's known comes from theory, heuristics, and strong engine play rather than from a certified, exhaustive proof of optimal play.
What "not solved" doesn't mean
It's worth being direct about a common misunderstanding: an unsolved game is not the same as a poorly understood game. How AI plays dots and boxes covers this in detail — modern engines combine the same theoretical tools Berlekamp developed (chain and loop analysis, the double-cross's mathematical value, parity reasoning) with search techniques strong enough to play at a level far beyond any human, on boards that have never been, and likely never will be, exhaustively solved. Being unsolved just means nobody can currently prove, with certainty, the optimal result from the starting position — it doesn't mean nobody can play the game extremely well.
This is a genuinely useful distinction for players to internalize: the chain rule, the double-cross technique, and parity counting are not guesses. They are theoretically grounded, extensively verified tools that hold up under rigorous analysis, even on boards too large to solve outright. You are not relying on folklore when you use them — you're relying on the same underlying theory that produced the exhaustive solutions for smaller boards, applied as very strong (if not provably perfect) heuristics at larger sizes.
Why a solved game doesn't stop being worth playing
There's a reflexive assumption that a solved game becomes pointless — if perfect play is known, why bother playing? Checkers, fully solved years ago, remains a played and enjoyed game; a solved outcome for perfect play from both sides doesn't change how interesting or difficult it is for two imperfect humans to actually execute that perfect play against each other. The gap between "the theoretical answer exists" and "I can reliably produce it under real playing conditions, against a real opponent, without a computer" is enormous, and closing that gap is most of what competitive skill actually consists of.
The same logic applies with even more force to dots and boxes at any size: knowing that a small board has a proven optimal outcome doesn't make playing it well easy, and playing large boards — which aren't solved at all — remains a genuinely open, skill-rewarding challenge regardless of what's true at the small end of the spectrum.
What this means for a competitive player
Practically, none of this changes how you should approach a real game. You will essentially never play a board small enough that "solved" status has any bearing on your preparation, and the theory that underlies the small-board solutions is the exact same theory — chains, loops, sacrifice, parity — that you should be using regardless of size. The research question of whether a specific board size has been solved is fascinating in its own right, but it sits alongside competitive play rather than changing it.
Summary
Small dots and boxes boards have genuinely been solved in the strict sense — exhaustively analyzed with certainty about optimal play. Standard and larger boards have not, and the combinatorial explosion involved makes it unlikely they will be anytime soon. But "not solved" doesn't mean "not understood" — the same theoretical tools that produced the small-board solutions power extremely strong play at every size that actually gets played.
A game being solved is a statement about mathematical certainty, not about how interesting or difficult it is to play well. Dots and boxes proves that distinction cleanly: solved at the small end, wide open at every size anyone actually plays, and rewarding real skill at both.