Lattice games without rational strategies
Combinatorics
2011-06-10 v1
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.
Keywords
Cite
@article{arxiv.1106.1883,
title = {Lattice games without rational strategies},
author = {Alex Fink},
journal= {arXiv preprint arXiv:1106.1883},
year = {2011}
}
Comments
11pp, 3 figs