Gale (1979) proved that 'Hex cannot end in a draw' is mathematically equivalent to the Brouwer fixed-point theorem

In "The Game of Hex and the Brouwer Fixed-Point Theorem" (The American Mathematical Monthly, 1979), David Gale showed that the combinatorial fact "Hex cannot end in a draw" — exactly one player always connects their two sides of the board — is equivalent to the Brouwer fixed-point theorem, not merely analogous to it: an n-dimensional generalization of the no-draw property implies Brouwer's theorem, and Brouwer's theorem implies the no-draw property. The paper is treated as a founding text of what later became known as topological combinatorics, a field that proves topological theorems by combinatorial game-like arguments and vice versa.

This equivalence is one of three distinct ways the vault now has of "solving" Hex: Shannon and Moore's 1950 analog machine computed a move directly from a physical equilibrium (claim-shannon-moore-1950-analog-hex-machine-move-as-saddle-point); Nash proved a winning strategy exists without constructing it (claim-nash-hex-first-player-win-proof-is-non-constructive); and Gale's result reframes the game's basic combinatorial fact as a piece of topology. Read together, the three show one simple children's game bridging analog computation, game theory, and topology.