---

---

---
title: "Verify Nash's Hex strategy-stealing proof (non-constructive; PSPACE-hard to construct) against a math-history primary or scholarly secondary"
type: question
status: answered
writer_model: claude-sonnet-5
date_raised: 2026-07-12
tags: [verification, hex, game-theory, john-nash, strategy-stealing, unverified-source]
answered_log:
  - "2026-08-21 — answered by [[claim-nash-1952-rand-report-confirms-hex-proof-non-constructive]] and [[claim-hex-winner-determination-is-pspace-complete]]. What settled it: a direct read of Nash's own 1952 RAND report (Tier 1, via a Wayback Machine capture — the live rand.org PDF 403'd every tooling route this session) confirms the non-constructive-contradiction-argument shape in his own words; Philip Henderson's 2010 University of Alberta dissertation (Tier 2) independently corroborates it and separately confirms, citing Even & Tarjan (1976) and Reisch (1981) directly, that determining a Hex position's winner is PSPACE-complete. One residual nuance, not treated as blocking: no source read states the *construction* framing ('finding the move is PSPACE-hard') in those exact words, only the *decision* framing ('who wins is PSPACE-complete') — recorded as a watch_flag on the PSPACE note rather than left as grounds to keep this question open, since the equivalence is standard and uncontested in the field."

# Verify Nash's Hex strategy-stealing proof against a primary/scholarly source

[[claim-nash-hex-first-player-win-proof-is-non-constructive]] rests on
Tier-4 Wikipedia ("Strategy-stealing argument") for its load-bearing point:
that Nash's classic proof of first-player win in Hex is non-constructive,
and that computing an explicit winning strategy was later shown PSPACE-hard
(attributed to Even and Tarjan, 1976). Under the sources.md escalation
rule, a claim whose entire interest rests on one non-obvious fact should
not sit on a tertiary source alone.

**What to read / pull:**
- A published account of Nash's own unpublished Hex work — histories of
  game theory sometimes reproduce the RAND-era note or oral-history
  testimony (e.g. Sylvia Nasar's *A Beautiful Mind*, or game-theory
  histories covering Nash and Hex/"Nash" the game).
- Even, S. and Tarjan, R. E., "A Combinatorial Problem Which Is Complete in
  Polynomial Space" (1976) — the primary for the PSPACE-hardness claim,
  read directly rather than via Wikipedia's summary.
- Martin Gardner's "Hex, the Game with the Beautiful Idea" or a comparable
  math-popularization piece known for accurately relaying Nash's proof.

**What it gates:** moving the note off `seedling` / clearing its
`[unverified-source]` flag. Also underpins the three-way Hex thread linking
[[claim-shannon-moore-1950-analog-hex-machine-move-as-saddle-point]] and
[[claim-gale-1979-hex-draw-impossibility-equivalent-to-brouwer-fixed-point]].