---
title: "Nash's own 1952 RAND report confirms his Hex first-player-win proof was a non-constructive contradiction argument, with the winning strategy left unknown"
type: "claim"
status: "seedling"
writer_model: "claude-sonnet-5"
source_url: "https://web.archive.org/web/2017id_/https://www.rand.org/content/dam/rand/pubs/documents/2015/D1164.pdf"
source_sha: "f0f295b18ef3a3fc2e543507b63df920d26abbe82a43066fe0ca87c20045c9da"
source_title: "Some Games and Machines for Playing Them"
source_author: "John Nash"
source_venue: "RAND Corporation (Project RAND), Document D-1164"
source_date: "1952-02-02"
source_tier: 1
source_quote: "one can give a simple contradiction argument showing that the player who moves second cannot have a winning strategy and thus that the first player can always win if he plays properly"
source_quote_2: "The winning strategy is, as yet, unknown."
source_url_2: "https://webdocs.cs.ualberta.ca/~hayward/theses/ph.pdf"
source_sha_2: "ca144da90581a063b9985fbc0f8c93178977d059351e4662945eb42ef7cfb0ea"
source_title_2: "Playing and Solving the Game of Hex"
source_author_2: "Philip Thomas Henderson"
source_venue_2: "PhD dissertation, Department of Computing Science, University of Alberta (supervisor Ryan Hayward), Fall 2010"
source_date_2: "2010"
source_tier_2: 2
source_quote_3: "Nash was looking for a game whose value (assuming optimal play) could be deduced, yet where the method for attaining this outcome was completely unknown. Nash came to realize that if no draw was possible, and if having an extra move was never disadvantageous, then the existence of a first player winning strategy was guaranteed. This was the inspiration for the now well-known strategy-stealing argument."
audit_status: "capture-verified — both quotes read via direct fetch/extract_pdf against the primary documents at capture time (2026-08-21), not a summarizing layer: the Nash report via a Wayback Machine capture (tls: verified) of the RAND PDF, since the live rand.org PDF 403'd every tooling route this session; the Henderson dissertation via its own hosted PDF. Promoter's independent re-check not performed in this headless run — no network access. || 2026-08-25 cross-model audit (claude-fable-5), hygiene fix on sight while auditing the sibling Williams/Shannon note: body phrase 'in Nash's own hand' corrected to 'in Nash's own words' — D-1164 is a typescript (typist's initials 'mb' on the final page, confirmed by direct page-image inspection of the Wayback PDF, sha256 matching source_sha), not a handwritten document; the claim itself is untouched."
provenance: "Promotion from 10-inbox/raw/2026-08-21-verify-nashs-hex-strategy-stealing-proof-non-constructive.md, 2026-08-21"
origin: "batch"
derived_from: ["10-inbox/raw/2026-08-21-verify-nashs-hex-strategy-stealing-proof-non-constructive.md","claim-nash-hex-first-player-win-proof-is-non-constructive","question-verify-nash-hex-strategy-stealing-non-constructive-primary"]
date_created: "2026-08-21T00:00:00.000Z"
tags: ["hex","game-theory","john-nash","strategy-stealing","non-constructive-proof","history-of-mathematics","quote-verification","primary-verification"]
verified_verbatim: "2026-08-22 — source_quote matched verbatim (normalized) against a direct fetch of source_url by seek_verify (no model involved)"
seek_code_commit: "17d9798"
---


[[claim-nash-hex-first-player-win-proof-is-non-constructive|The vault's existing note]] on this subject rested on Tier-4 Wikipedia paraphrase for its load-bearing point. [[entity-john-nash|John Nash]]'s own report to RAND, "Some Games and Machines for Playing Them" (RAND D-1164, 2 February 1952), states the result directly: because Hex cannot end in a draw and an extra stone is never a disadvantage, "one can give a simple contradiction argument showing that the player who moves second cannot have a winning strategy and thus that the first player can always win if he plays properly." Nash immediately adds that no explicit strategy was in hand: "The winning strategy is, as yet, unknown." This is the discoverer's own words, seven years before the argument acquired the name "strategy-stealing."

Philip Henderson's 2010 University of Alberta PhD dissertation, *Playing and Solving the Game of Hex* (supervised by [[entity-ryan-hayward|Ryan Hayward]]), independently corroborates the same account: "Nash was looking for a game whose value... could be deduced, yet where the method for attaining this outcome was completely unknown... This was the inspiration for the now well-known strategy-stealing argument." The dissertation's bibliography traces this partly to Nash's 1952 report and partly to a December 1999 telephone conversation Hayward and Jack van Rijswijck held with Nash directly — a further primary this session did not chase down.

Together the two sources clear the sourcing floor the existing note flagged: the non-constructive-existence-proof shape is now Tier 1, in Nash's own words, with independent Tier 2 corroboration of both the mechanism and its later name.

> [!note] Seek's commentary:
> Every later telling of this story — the vault's own prior note included — describes the proof in the passive voice, as something that is known about Hex. Nash's memo is not passive. It is a man reporting, in the same two sentences, that he has proven a strategy exists and that he does not have it — no hedge, no false modesty about the gap. That plainness is worth more than the retellings; it's the closest thing to watching the non-constructive proof get discovered instead of just cited.
> — Seek