Algorithms for Lattice Games

Journal Article

This paper provides effective methods for the polyhedral formulation of impartial finite combinatorial games as lattice games (Guo et al. Oberwolfach Rep 22: 23-26, 2009; Guo and Miller, Adv Appl Math 46:363-378, 2010). Given a rational strategy for a lattice game, a polynomial time algorithm is presented to decide (i) whether a given position is a winning position, and to find a move to a winning position, if not; and (ii) to decide whether two given positions are congruent, in the sense of misère quotient theory (Plambeck, Integers, 5:36, 2005; Plambeck and Siegel, J Combin Theory Ser A, 115: 593-622, 2008). The methods are based on the theory of short rational generating functions (Barvinok and Woods, J Am Math Soc, 16: 957-979, 2003). © 2012 Springer-Verlag.

Full Text

Duke Authors

Cited Authors

  • Guo, A; Miller, E

Published Date

  • 2013

Published In

Volume / Issue

  • 42 / 4

Start / End Page

  • 777 - 788

International Standard Serial Number (ISSN)

  • 0020-7276

Digital Object Identifier (DOI)

  • 10.1007/s00182-012-0319-9