Infinite Cyclic Impartial Games
Conference paper
First Online:
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.
Keywords
infinite cyclic games locally path-bounded digraphs generalized Sprague-Grundy functionPreview
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.MATHGoogle Scholar
- 2.J. H. Conway 1976, On Numbers and Games, Academic Press, London.MATHGoogle 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.MATHCrossRefMathSciNetGoogle Scholar
- 5.J. A. Flanigan 1983, Slow joins of loopy games, J. Combin. Theory (Ser. A) 34, 46–59.MATHCrossRefMathSciNetGoogle 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.MATHCrossRefMathSciNetGoogle 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.MATHCrossRefMathSciNetGoogle Scholar
- 10.A. S. Fraenkel and U. Tassa 1982, Strategies for compounds of partizan games, Math. Proc. Camb. Phil. Soc. 92, 193–204.MATHMathSciNetGoogle 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.MATHCrossRefMathSciNetGoogle Scholar
- 12.A. S. Shaki 1979, Algebraic solutions of partizan games with cycles, Math. Proc. Camb. Phil. Soc. 85, 227–246.MATHMathSciNetCrossRefGoogle Scholar
- 13.W. Sierpiński 1958, Cardinal and Ordinal Numbers, Hafner, New York.MATHGoogle 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.MATHCrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1999