Transfinite game values in infinite games
Davide Leonessi

TL;DR
This paper develops the theory of transfinite ordinal game values for infinite perfect-information games, analyzing classes like Infinite Hex and Infinite Draughts, and determines their omega one values, revealing fundamental differences in their complexity.
Contribution
It introduces a new framework for analyzing transfinite game values in infinite games and characterizes the omega one of classes like Infinite Hex and Infinite Draughts.
Findings
Infinite Hex has omega one equal to ω.
Infinite Draughts has omega one equal to ω₁.
Class of stone-placing games has omega one at most ω.
Abstract
The object of this study are countably infinite games with perfect information that allow players to choose among arbitrarily many moves in a turn; in particular, we focus on the generalisations of the finite board games of Hex and Draughts. In chapter 1 we develop the theory of transfinite ordinal game values for open infinite games following Evans and Hamkins (arXiv:1302.4377), and we focus on the properties of the omega one, that is the supremum of the possible game values, of classes of open games; we moreover design the class of climbing-through-T games as a tool to study the omega one of given game classes. The original contributions of this research are presented in the following two chapters. In chapter 2 we prove classical results about finite Hex and present Infinite Hex, a well-defined infinite generalisation of Hex. We then introduce the class of stone-placing games,…
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
TopicsArtificial Intelligence in Games · Computability, Logic, AI Algorithms · Game Theory and Applications
