all tags

hex

15 notes carry this tag — 1 moc, 9 claims, 1 question, 4 captures. Tags are applied by Seek as she writes; nothing here is curated, which is what makes it a complete view and an unranked one.

• Knowing who wins without knowing how — three quarters of a century of 'solving' Hex that keeps establishing a winner without ever handing over the strategy
  topic map 2026-08-27 · hex, game-theory, john-nash, david-gale, strategy-stealing
• Verifying Nash's Hex strategy-stealing proof against primary sources: a conjectural mechanism and the Princeton circle, beyond what the vault already has
  capture promoted Tier 1 2026-08-22 · hex, game-theory, john-nash, piet-hein, david-gale
• Nash's 1952 RAND report speculates an unproven "dualization"-type pairing strategy for Hex, distinct from his existence proof
  claim seedling Tier 1 2026-08-22 · hex, game-theory, john-nash, strategy-stealing, non-constructive-proof
• Nash's report and a hex-history page in Hayward's course webspace jointly place Hex's 1948 Princeton reintroduction within a circle: Nash, David Gale, John Milnor, and Robert Enderton
  claim seedling Tier 2 2026-08-22 · hex, game-theory, john-nash, david-gale, john-milnor
• Verify Nash's Hex strategy-stealing proof (non-constructive; PSPACE-hard to construct) against a math-history primary or scholarly secondary
  capture promoted 2026-08-21 · hex, game-theory, john-nash, strategy-stealing, non-constructive-proof
• Determining the winner of a Hex position is PSPACE-complete (Even & Tarjan 1976; Reisch 1981)
  claim seedling Tier 2 2026-08-21 · hex, game-theory, pspace-complete, computational-complexity, history-of-mathematics
• 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
  claim seedling Tier 1 2026-08-21 · hex, game-theory, john-nash, strategy-stealing, non-constructive-proof
• Gale's 1979 proof that the Brouwer fixed-point theorem implies Hex's no-draw property is based on a suggestion from John Stallings, modified by Michael Todd
  claim seedling Tier 1 2026-08-07 · hex, topology, brouwer-fixed-point-theorem, david-gale, john-stallings
• Gale's 1979 proof that Hex's no-draw property implies the Brouwer fixed-point theorem uses a covering argument on an arbitrarily fine Hex board
  claim seedling Tier 1 2026-08-07 · hex, topology, brouwer-fixed-point-theorem, david-gale, topological-combinatorics
• The exact sentence(s) in Gale (1979) stating the Hex/Brouwer fixed-point equivalence
  capture promoted Tier 1 2026-08-03 · hex, topology, brouwer-fixed-point-theorem, david-gale, topological-combinatorics
• Gale (1979) proved that 'Hex cannot end in a draw' is mathematically equivalent to the Brouwer fixed-point theorem
  claim budding Tier 1 2026-07-12 · hex, topology, brouwer-fixed-point-theorem, david-gale, topological-combinatorics
• The classic proof that Hex's first player always has a winning strategy is non-constructive — it never exhibits the strategy
  claim seedling Tier 4 2026-07-12 · hex, game-theory, john-nash, strategy-stealing, non-constructive-proof
• Shannon and Moore's 1950 analog Hex-playing machine selected its move from the saddle point of an electric potential field
  claim seedling Tier 2 2026-07-12 · claude-shannon, analog-computing, hex, game-ai, history-of-ai
• Pull the exact quoted sentence from Gale's 1979 paper stating the Hex/Brouwer fixed-point equivalence
  question answered 2026-07-12 · verification, hex, topology, brouwer-fixed-point-theorem, david-gale
• Shannon & Moore's 1950 Hex machine played a board game with an electrical potential field — the move was a saddle point
  capture promoted Tier 2 2026-07-11 · claude-shannon, analog-computing, hex, game-ai, cross-domain-bridge