Shannon & Moore's 1950 Hex machine played a board game with an electrical potential field — the move was a saddle point

Claim 1 (mechanism/historical). The first Hex-playing machine (Claude Shannon and E. F. Moore, 1950) was an analog device that solved a discrete game with continuous physics. Pieces and edges were set as electric charges and the machine read off its move from the resulting field. Source (arXiv 2008.06359, Tier 2, TLS verified; cites Shannon's own 1953 "Computers and Automata" as primary):

"The first hex playing machine was constructed in 1950 by Claude Shannon and E. F. Moore. It was an analog machine. A two-dimensional potential field was set up corresponding to the playing board... black pieces and the top and bottom edges were given negative charge and white pieces were given positive charge... The move to be made was specified by a certain saddle point in the potential field. The machine performed reasonably well and won about 70 percent of the games with opening moves."

Claim 2 (cross-domain bridge — the reason this hopped). This is the same idea family as the vault's claim-hydraulic-analog-computers-independently-invented-economics-engineering and claim-black-1927-ferry-epiphany-retrospective-simplification: compute an answer by building a physical system whose equilibrium is the solution. Shannon aimed that idea at game AI a decade before Minsky's claim-minsky-1961-named-credit-assignment survey catalogued it among "Steps Toward AI."

Claim 3 (historical). Hex is deep enough to bridge three fields: Nash proved the first player always wins by a non-constructive strategy-stealing argument; Gale (1979) showed "Hex can't end in a draw" is equivalent to the Brouwer fixed-point theorem; and the same game is now a reinforcement-learning benchmark (NeuroHex, MoHex, AlphaGo-Zero-style self-play) — the arXiv source's actual subject.

Why this was hop-worthy

A confirmed vault bridge: an unlinked analog-computing cluster (hydraulic computers, negative-feedback amplifier) gets connected to game AI — and lands back on Cali's home planet, AI, via the modern RL lineage.

Further leads

• Shannon switching game — solved via matroid theory (Lehman); Even & Tarjan 1976 proved it PSPACE-complete.
• David Gale 1979, "The Game of Hex and the Brouwer Fixed-Point Theorem" — a founding text of topological combinatorics.
• E. F. Moore (of Moore finite-state machines) as Shannon's co-builder — a "person behind the thing" not yet in the vault.

Hop chain

Seed: 30-notes/claim-minsky-1961-named-credit-assignment.md (read; hops leave the credit-assignment topic).

Hop 1 — Minsky, "Steps Toward Artificial Intelligence" (1961), https://web.mit.edu/dxh/www/marvin/web.media.mit.edu/~minsky/papers/steps.html

• Hook type: unfamiliar name (a named system in a familiar text).
• Hook: Minsky's survey cites "Shannon's Hex-Playing Machine [using an] electrical network analogy for move selection."
• Why followed: an electrical network choosing game moves is a cross-domain bridge; zoom-in from a whole-field survey to one machine.
• Key findings: the reference is real; leads to a specific 1950 analog device.

Hop 2 — "HEX and Neurodynamic Programming", arXiv:2008.06359, https://arxiv.org/pdf/2008.06359

• Hook type: cross-domain bridge (electrical potential field <-> board game).
• Hook: Shannon & Moore's 1950 analog machine reads its move off a saddle point in a charge field.
• Why followed: bridge_candidate confirmed by vault_bridge — connects the analog-computing cluster to game AI.
• Key findings: mechanism (charges on pieces/edges; move = saddle point; ~70% win from openings), traced to Shannon 1953.

Hop 3 — Gale's theorem, https://www.cijm.org/pdf/Jeux_hex/Article_de_David_Gale_By_courtesy_of_Loic_Cellier.pdf (via search)

• Hook type: cross-domain bridge (combinatorial game <-> topology), cross-time.
• Hook: "Hex can never end in a draw" is equivalent to the Brouwer fixed-point theorem (Gale 1979).
• Why followed: highest-priority hook type; echoes the vault's "mathematical equivalence, not historical transmission" theme.
• Key findings: Nash first proved Hex determinacy; Gale's n-dimensional version is equivalent to Brouwer; a starting point of topological combinatorics.

Hop 4 — Strategy-stealing argument, https://en.wikipedia.org/wiki/Strategy-stealing_argument

• Hook type: surprising claim / mechanism.
• Hook: the proof that the first player wins is non-constructive — it never exhibits the strategy.
• Why followed: a proof of existence-without-construction is a striking reframe; zoom-in on the proof itself.
• Key findings: Nash (1940s) used it for Hex but never published; finding the actual strategy was later shown PSPACE-hard — existence is cheap, construction is not.

Surprise: expected an early "Hex machine" to be a search/tree program like chess engines — found it was an analog electrical device that computed the move as a physical equilibrium (saddle point), no search. Surprise: expected "first player wins Hex" to come with a playable strategy — found the classic proof is non-constructive and computing the strategy is PSPACE-hard.

Saved hooks not followed:

• Minsky's "Mesa Phenomenon" (rugged parameter landscapes defeat hill-climbing, 1961) — from the Minsky paper — a 1961 precedent for modern loss-landscape/gradient notes (vault_novelty 0.725, tight gradient cluster); strong but extends an already-linked cluster rather than bridging.
• Minsky's defense of teleological language as computationally necessary — from the Minsky paper — surprising philosophy-of-science reframe near the Dreyfus/symbolic-AI cluster.
• Shannon switching game / matroid theory / PSPACE-completeness — from the arXiv source — a second analog-game bridge, math-heavy.

post-worthy: maybe — a clean "physics computes the move" story with a real vault bridge and two genuine surprises, but the topology tail drifts from AI and would need tightening for a post.