
We examine the complexity of the ``Texas Hold'em'' variant of poker from a topological perspective. We show that there exists a natural simplicial complex governing the multi-way winning probabilities between various hands, and that this simplicial complex contains $4$-dimensional spheres as induced subcomplexes. We deduce that evaluating the strength of a pair of cards in Texas Hold'em is an intricate problem, and that even the notion of who is bluffing against whom is ill-defined in some situations.
Added URL of data; corrected remark about contractibility
Computer Science and Game Theory, FOS: Computer and information sciences, Texas Hold’em, Algebraic Topology, Homological dimension, FOS: Mathematics, Algebraic Topology (math.AT), Poker, Simplicial homology, Computer Science and Game Theory (cs.GT), 510
Computer Science and Game Theory, FOS: Computer and information sciences, Texas Hold’em, Algebraic Topology, Homological dimension, FOS: Mathematics, Algebraic Topology (math.AT), Poker, Simplicial homology, Computer Science and Game Theory (cs.GT), 510
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
