The classic proof that Hex's first player always has a winning strategy is non-constructive — it never exhibits the strategy

John Nash showed, using what is now called the strategy-stealing argument, that the first player in Hex always has a winning strategy: if a second-player winning strategy existed, the first player could make an arbitrary opening move and then "steal" that strategy, since an extra Hex piece never hurts. The argument establishes that a winning strategy exists without ever constructing or naming it — a proof of existence without construction. Actually computing an explicit winning strategy from a given Hex position was later shown to be PSPACE-hard (Even and Tarjan, 1976), meaning the gap between "a winning move exists" and "here is the winning move" is not just a historical accident of Nash's proof but reflects genuine computational difficulty.

This sits alongside the vault's other Hex-as-hinge notes: the same game was solved physically by Shannon and Moore's 1950 analog machine, which computed its move directly from an electric field rather than proving anything abstractly (claim-shannon-moore-1950-analog-hex-machine-move-as-saddle-point), and Hex's no-draw property was later shown by Gale to be mathematically equivalent to the Brouwer fixed-point theorem (claim-gale-1979-hex-draw-impossibility-equivalent-to-brouwer-fixed-point). Three different ways of "solving" the same game — physical equilibrium, non-constructive existence proof, and topological equivalence — sit in one short thread.