Generated by GPT-5-mini| Hex (board game) | |
|---|---|
| Name | Hex |
| Designer | Piet Hein; John Nash |
| Publisher | Parker Brothers; Avalon Hill; guttenberg press |
| Playing time | 10–60 minutes |
| Random chance | None |
| Skills | Strategy, Combinatorics, Topology |
Hex (board game) is an abstract strategy board game for two players played on a rhombus of hexagonal cells, where each player attempts to form an unbroken chain connecting opposite sides. Originating from independent designs by Piet Hein and John Nash, Hex has influenced fields ranging from combinatorial game theory to artificial intelligence, and has been studied by figures associated with Princeton University, Harvard University, and University of Cambridge.
Hex was first published in 1942 as "Polygon" by Piet Hein at Danish resistance, and later independently rediscovered and analyzed by John Nash at Princeton University in the late 1940s. The game entered commercial circulation through companies such as Parker Brothers and G. J. Bell and found proponents among intellectual circles at Massachusetts Institute of Technology, University of Oxford, and École Normale Supérieure. Historical players and commentators include members of Copenhagen Circle, Cambridge Apostles, and mathematicians linked to Hilbert space research; its adoption spread through mathematical societies and gaming communities associated with Danish Academy of Sciences and American Mathematical Society. Notable historical moments include formalization by researchers at Harvard University and coverage in periodicals like Scientific American and Games Magazine.
Hex is played on an n×n board (commonly 11×11) of hexagonal cells; one player attempts to connect the opposing sides marked for their color while the other player connects the other pair of opposing sides. Play alternates with players placing stones of their color on empty cells; the game cannot end in a draw due to a topological theorem related to the Jordan curve theorem and results in a forced win for the first player on finite boards. A standard procedure to balance first-move advantage is the "swap rule" (also called the "pie rule"), proposed in club play and discussed in publications from Cambridge University Press and institutions such as INRIA and University of California, Berkeley. Tournament rules are codified by organizers affiliated with International Mind Sports Association, Mind Sports Olympiad, and regional groups at European Go Federation-linked clubs.
Hex strategy draws on concepts from graph theory, topology, and combinatorics. Fundamental ideas include creating virtual connections, bridging, and controlling key hexes that function as critical vertices in connectivity arguments studied by researchers at Stanford University and Massachusetts Institute of Technology. Mathematical results about Hex have been contributed by academics at Princeton University, University of Cambridge, and Rutgers University; proofs concerning the first-player win use strategy-stealing arguments attributed to thinkers in the 20th century mathematics community. Computational complexity analyses showing PSPACE-hardness and algorithmic boundaries were published by teams at MIT Lincoln Laboratory, Carnegie Mellon University, and University of Toronto. Opening theory and endgame patterns have been cataloged by practitioners from Japanese Go Association-linked study groups and American clubs associated with American Go Association.
Variants of Hex include different board shapes and sizes (rhombus, parallelogram, and irregular graphs) explored in workshops at Royal Society, Institut Henri Poincaré, and educational programs at Massachusetts Institute of Technology. Related connection games such as Yavalath, TwixT, Bridg-It, and Havannah share motifs with Hex and were studied in comparative analyses at University of Cambridge and University of Oxford. Electronic and commercial adaptations have been developed by companies and labs including Atari, Microsoft Research, and university spin-offs from ETH Zurich and EPFL; mobile and online implementations appear on platforms tied to BoardGameGeek and communities hosted by Lichess-style services.
Competitive Hex has organized events at gatherings such as the Mind Sports Olympiad, university tournaments at Princeton University and Harvard University, and national championships in countries including United States, United Kingdom, Denmark, and Japan. Governing and event-organizing bodies have included regional groups affiliated with European Go Federation networks and university societies at University of Cambridge and University of Oxford. Notable champions and contributors to competitive theory have affiliations with Princeton University, Stanford University, and national mathematics olympiad teams; tournaments often apply the swap rule and time controls similar to those used in chess and Go competitions organized by FIDE-linked events.
Hex has influenced cultural and scientific milieus, appearing in literature and lectures associated with John Nash and being referenced in academic outreach by institutions such as Institute for Advanced Study and Royal Institution. Computer analysis of Hex has driven advances in artificial intelligence and search algorithms: work by research groups at University of Alberta, DeepMind, and Carnegie Mellon University explored Monte Carlo tree search, minimax, and machine-learning agents adapted for Hex. Classic algorithms and proofs from scholars at Princeton University and MIT informed automated play; contemporary programs compete in online arenas maintained by communities on platforms connected to BoardGameGeek and research benchmarks hosted by arXiv contributors. Hex continues to appear in curricula and public demonstrations at venues such as Science Museum, London, Smithsonian Institution, and university outreach programs, intersecting the histories of modern mathematics, computation, and recreational play.
Category:Abstract strategy board games