Skip to main content
SpringerLink
Log in

Infinite Cyclic Impartial Games

  • Conference paper
  • First Online:
Computers and Games (CG 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1558))

Included in the following conference series:

  • 463 Accesses

Abstract

We define the family of locally path-bounded digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible, in a finite number of moves. This is done by proving that the Generalized Sprague-Grundy function exists uniquely and has finite values on this class.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. R. Berlekamp, J. H. Conway and R. K. Guy 1982, Winning Ways (two volumes), Academic Press, London.

    MATH  Google Scholar 

  2. J. H. Conway 1976, On Numbers and Games, Academic Press, London.

    MATH  Google Scholar 

  3. J. H. Conway 1978, Loopy Games, Ann. Discrete Math. 3, Proc. Symp. Advances in Graph Theory, Cambridge Combinatorial Conf. (B. Bollobás, ed.), Cambridge, May 1977, pp. 55–74.

    Google Scholar 

  4. J. A. Flanigan 1981, Selective sums of loopy partizan graph games, Internat. J. Game Theory 10, 1–10.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. A. Flanigan 1983, Slow joins of loopy games, J. Combin. Theory (Ser. A) 34, 46–59.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. S. Fraenkel > 1999, Adventures in Games and Computational Complexity, to appear in Graduate Studies in Mathematics, Amer. Math. Soc., Providence, RI.

    Google Scholar 

  7. A. S. Fraenkel and A. Kotzig 1987, Partizan octal games: partizan subtraction games, Internat. J. Game Theory 16, 145–154.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. S. Fraenkel and Y. Perl 1975, Constructions in combinatorial games with cycles, Coll. Math. Soc. János Bolyai, 10, Proc. Internat. Colloq. on Infinite and Finite Sets, Vol. 2 (A. Hajnal, R. Rado and V. T. Sós, eds.) Keszthely, Hungary, 1973, North-Holland, pp. 667–699.

    Google Scholar 

  9. A. S. Fraenkel and U. Tassa 1975, Strategy for a class of games with dynamic ties, Comput. Math. Appl. 1, 237–254.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. S. Fraenkel and U. Tassa 1982, Strategies for compounds of partizan games, Math. Proc. Camb. Phil. Soc. 92, 193–204.

    MATH  MathSciNet  Google Scholar 

  11. A. S. Fraenkel and Y. Yesha 1986, The generalized Sprague-Grundy function and its invariance under certain mappings, J. Combin. Theory (Ser. A) 43, 165–177.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. S. Shaki 1979, Algebraic solutions of partizan games with cycles, Math. Proc. Camb. Phil. Soc. 85, 227–246.

    Article  MATH  MathSciNet  Google Scholar 

  13. W. Sierpiński 1958, Cardinal and Ordinal Numbers, Hafner, New York.

    MATH  Google Scholar 

  14. C. A. B. Smith 1966, Graphs and composite games, J. Combin. Theory 1, 51–81. Reprinted in slightly modified form in: A Seminar on Graph Theory (F. Harary, ed.), Holt, Rinehart and Winston, New York, NY, 1967.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 76100, Israel

    Aviezri S. Fraenkel & Ofer Rahat

Authors
  1. Aviezri S. Fraenkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ofer Rahat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maastricht, Maastricht, The Netherlands

    H. Jaap van den Herik

  2. Department of Computer Science, Shizuoka University, Hamamatsu, Japan

    Hiroyuki Iida

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fraenkel, A.S., Rahat, O. (1999). Infinite Cyclic Impartial Games. In: van den Herik, H.J., Iida, H. (eds) Computers and Games. CG 1998. Lecture Notes in Computer Science, vol 1558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48957-6_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-48957-6_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65766-8

  • Online ISBN: 978-3-540-48957-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation