Mind the gap: A real-valued distance on combinatorial games
Kyle Burke, Michael Fisher, Craig Tennenhouse

TL;DR
This paper introduces a real-valued distance metric on short combinatorial games, explores its topological properties, and investigates the structure of loopy games and their limits within this metric space.
Contribution
It defines a new distance metric on combinatorial games, analyzes the topological structure of the game space, and characterizes limit points and partitions of loopy games.
Findings
Existence of Cauchy sequences in the game space
Identification of limit points and closure properties
Partitioning of loopy games in the metric space
Abstract
We define a real-valued distance metric on the space of short combinatorial games in canonical form. We demonstrate the existence of Cauchy sequences informed by sidling sequences, find limit points, and investigate the closure , which is shown to partition the set of loopy games in a non-trivial way. Stoppers, enders, and non-stopper-sided loopy games are explored, as well as the topological properties of .
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
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Artificial Intelligence in Games
