A Brief Review of Fixed Points, Hex Game and Hex Theorem
Cho Yang

TL;DR
This paper reviews the mathematical foundations of Hex, focusing on fixed point theorems and the Hex Theorem, to explain why a tie is impossible in the game.
Contribution
It provides a concise overview of the equivalence between fixed point theorems and the Hex Theorem, clarifying their role in game theory.
Findings
Hex cannot end in a tie due to topological constraints
Fixed point theorems underpin the Hex Theorem
The equivalence explains the game's inherent properties
Abstract
Understanding the Impossibility of a Tie in Hex via Fixed Point Theorems, the Hex Theorem, and Their Equivalence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Game Theory and Voting Systems · Game Theory and Applications
