Theory of Computing Systems

, Volume 48, Issue 3, pp 680–692 | Cite as

On the Complexity of Computing Winning Strategies for Finite Poset Games

Article

Abstract

This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a simple proof of this fact by a reduction to the game of geography. We also show how to formalize the reasoning about poset games in Skelley’s theory \(\mathbf{W}_{1}^{1}\) for PSPACE reasoning. We conclude that \(\mathbf{W}_{1}^{1}\) can use the “strategy stealing argument” to prove that in poset games with a supremum the first player always has a winning strategy.

Keywords

Finite games Posets PSPACE Proof complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bouton, C.L.: Nim, a game with a complete mathematical theory. Ann. Math. 3(1/4), 35–39 (1902) CrossRefMathSciNetGoogle Scholar
  2. 2.
    Gale, D.: A curious nim-type game. Am. Math. Mon. 81(8), 876–879 (1974) MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Schäfer, T.J.: Complexity of some two-person perfect-information games. J. CSS 16, 185–225 (1978) MATHGoogle Scholar
  4. 4.
    Skelley, A.: A third-order bounded arithmetic theory for PSPACE. In: Computer Science Logic, 18th International Workshop, pp. 340–354 (2004) Google Scholar
  5. 5.
    Úlehla, J.: A complete analysis of Von Neumann’s Hackendot. Int. J. Game Theory 9, 107–113 (1980) MATHCrossRefGoogle Scholar
  6. 6.
    Berlekamp, E., Conway, J., Guy, R.: Winning Ways for Your Mathematical Plays, 2nd edn., vol. 1. AK Peters, Wellesley (2001) MATHGoogle Scholar
  7. 7.
    Conway, J.: On Numbers and Games, 2nd edn. AK Peters, Wellesley (2001) MATHGoogle Scholar
  8. 8.
    Papadimitriou, C.H.: Computational Complexity. Addison Wesley Longman, Reading (1995) Google Scholar
  9. 9.
    Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Course Technology (2006) Google Scholar
  10. 10.
    Zeilberger, D.: Three-rowed CHOMP. Adv. Appl. Math. 26, 168–179 (2001) MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Sun, X.: Improvements on chomp. Integers: Electron. J. Comb. Number Theory 2(G01), 1–8 (2002) Google Scholar
  12. 12.
    Friedman, E.J., Landsberg, A.S.: Nonlinear dynamics in combinatorial games: Renormalizing chomp. Chaos: Interdiscip. J. Nonlinear Sci. 17(2) (2007) Google Scholar
  13. 13.
    Byrnes, S.: Poset game periodicity. Integers: Electron. J. Comb. Number Theory 3(G03) (2003) Google Scholar
  14. 14.
    Cook, S., Nguyen, P.: Foundations of Proof Complexity: Bounded Arithmetic and Propositional Translations. www.cs.toronto.edu/~sacook/csc2429h/book (2006)
  15. 15.
    Herman, G.: Private communication. McMaster University (2006) Google Scholar
  16. 16.
    Cook, S.: Private communication. University of Toronto (2008) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computing and SoftwareMcMaster UniversityHamiltonCanada

Personalised recommendations