Lattice games without rational strategies

DOI10.1016/j.jcta.2011.10.005zbMath1356.91033arXiv1106.1883OpenAlexW2001471083WikidataQ57432796 ScholiaQ57432796MaRDI QIDQ654900

Alex Fink

Publication date: 23 December 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.1883

zbMATH Keywords

cellular automatacombinatorial gameslattice gamescomputational universality

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Algorithms for lattice games ⋮ Impartial games emulating one-dimensional cellular automata and undecidability ⋮ From heaps of matches to the limits of computability ⋮ Affine stratifications from finite misère quotients. ⋮ A cellular automaton for blocking queen games ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Lattice point methods for combinatorial games
• Misère quotients for impartial games
• Short rational generating functions for lattice point problems
• Simple Computation-Universal Cellular Spaces

This page was built for publication: Lattice games without rational strategies