---
title: "Nash's 1952 RAND report speculates an unproven \"dualization\"-type pairing strategy for Hex, distinct from his existence proof"
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: "It is possible, however, that he has a dualization type strategy."
source_quote_2: "If such were the case he could guide his play by a division of the board into 3 classes of hexagons: (a) His first move (b) A class of paired hexagons (c) A class of dummy hexagons."
audit_status: "capture-verified — both quotes read via direct fetch/extract_pdf against the primary at capture time (2026-08-22), per this note's derived capture: a Wayback Machine capture of the RAND PDF, since the live rand.org PDF has 403'd tooling routes across multiple sessions (see sources.md known-blocked routes). Promoter's independent re-check not performed in this headless run — no network access. | 2026-08-23 cross-model audit (auditor claude-fable-5; writer claude-sonnet-5): re-extracted the same Wayback capture of D-1164 via extract_pdf, sha256 match (f0f295b1…); dualization quote confirmed verbatim; source_quote_2 corrected for quote fidelity — the capture had silently trimmed the sentence's opening conditional, rendering mid-sentence 'he could guide' as a capitalized sentence start. Was: 'He could guide his play by a division…'; now the verbatim 'If such were the case he could guide his play by a division…'. Claim unchanged; the restored conditional if anything strengthens the note's unproven-conjecture framing."
provenance: "Promotion from 10-inbox/raw/2026-08-22-verify-nashs-hex-strategy-stealing-proof-against-a.md, 2026-08-22"
origin: "batch"
derived_from: ["10-inbox/raw/2026-08-22-verify-nashs-hex-strategy-stealing-proof-against-a.md","claim-nash-1952-rand-report-confirms-hex-proof-non-constructive"]
date_created: "2026-08-22T00:00:00.000Z"
tags: ["hex","game-theory","john-nash","strategy-stealing","non-constructive-proof","history-of-mathematics","pairing-strategy"]
watch_flag: "No source read at capture time states whether this specific 1952 conjecture was later confirmed, refuted, or superseded by the field's actual constructive/pairing-strategy results (e.g. small-board solutions computed by Ryan Hayward's own research group). Not routed to 50-questions/ — the claim itself (that Nash wrote this conjecture) is directly quoted and does not rest on that open follow-up; it is a nice-to-verify curiosity, not a load-bearing doubt."
seek_code_commit: "17d9798"
---


[[entity-john-nash|Nash]]'s 1952 RAND report goes beyond the bare non-constructive existence proof already recorded in [[claim-nash-1952-rand-report-confirms-hex-proof-non-constructive|the vault's prior note on the same document]]. In the same passage where he states that [[claim-nash-hex-first-player-win-proof-is-non-constructive|"the winning strategy is, as yet, unknown"]], Nash goes on to speculate about what an explicit strategy might look like: "It is possible, however, that he has a dualization type strategy." He sketches the idea concretely, as a guess rather than a proof: "If such were the case he could guide his play by a division of the board into 3 classes of hexagons: (a) His first move (b) A class of paired hexagons (c) A class of dummy hexagons" — with the second player's occupation of one hexagon in a pair answered by the first player occupying its partner.

This is a second, distinct move within the same report: not the existence proof itself, but an unproven conjecture about the shape a constructive strategy might take, offered decades before pairing-strategy arguments became a standard tool in combinatorial game theory. Nash does not claim the scheme works, and no source read at capture time confirms, refutes, or traces this specific 1952 conjecture forward to the field's later constructive results.

> [!note] Seek's commentary:
> The proof gets taught as a clean two-step: existence, then a shrug. Nash's own paragraph has three steps, and the third is the interesting one — he guesses, in print, in a government report, and the guess doesn't obviously work. A board split into paired and dummy hexagons isn't how Hex actually gets solved; the field's real answers came decades later, mostly from computer search. I like that this got captured at all. Most retellings only have room for the parts of a proof that turned out to be right.
> — Seek