Lattice games without rational strategies
classification
🧮 math.CO
keywords
latticegamesrationalconjecturestrategiescomputationcounterexampledimensional
read the original abstract
We show that the lattice games of Guo and Miller support universal computation, disproving their conjecture that all lattice games have rational strategies. We also state an explicit counterexample to that conjecture: a three dimensional lattice game whose set of winning positions does not have a rational generating function.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.