An Inductive Proof of Hex Uniqueness

  title={An Inductive Proof of Hex Uniqueness},
  author={Samuel Clowes Huneke},
  journal={The American Mathematical Monthly},
  pages={78 - 80}
  • Samuel Clowes Huneke
  • Published 1 January 2014
  • Mathematics, Computer Science
  • The American Mathematical Monthly
Abstract A short, inductive proof is presented of the fact that a Hex board cannot be colored such that winning conditions are satisfied for both players. 
1 Citations
Percolation sur les groupes et modèles dirigés
Cette these porte sur deux types de problemes de mecanique statistique : il y est question de percolation sur les groupes et de modeles diriges. Dans le premier cas,il s’agit de realiser un groupeExpand


Hex and combinatorics
Inspired by Claude Berge's interest in and writings on Hex, we discuss some results on the game.
Hex Must Have a Winner: An Inductive Proof
The game of Hex is an excellent example of a game for which a winning strategy is known to exist, even though it is not known what the strategy is. It is easy to show the existence of a strategy onceExpand
The London School of Economics and Political Science Essays on performance, corporate financial strategy and organization of multinational banks in Africa
This thesis is composed of three stand-alone essays interlinked within the context of banking markets in sub-Saharan Africa. This research is motivated by the lack of comparative research onExpand
Hex: Everything you always wanted to know about Hex but were afraid to Ask
  • Ph.D. dissertation,
  • 2005
Can’t End in a Draw (1996), available at Curriculum/Games/YTheory.shtml
  • 1996
available at http://www.cut-the-knot
  • Draw
  • 1996
The Game of Hex and the Brouwer Fixed-Point Theorem
Symbols, Signals, and Noise: The Nature and Process of Communication.
Gale , The game of Hex and the Brouwer Fixed - Point Theorem
  • Amer . Math . Monthly
  • 1959