Skip to main content Accessibility help
×
Home

Strategies for compounds of partizan games

  • Aviezri S. Fraenkel (a1) and Uzi Tassa (a1)

Abstract

In this paper we define two order relations between every two partizan games with possible draw positions. We use these relations to prove two ‘simplest form’ theorems, and to describe an algorithm for computing the simplest form of the ‘finite games’ which are an extension of Conway's short games.

Copyright

References

Hide All
(1)Berlekamp, E. R., Conway, J. H. and Guy, R. K.Winning ways (Academic Press, London, 1982).
(2)Conway, J. H.On numbers and games (Academic Press, London, 1976).
(3)Conway, J. H.Loopy games. Ann. of Discrete Math. 3 (1978), 5574.
(4)Fraenkel, A. S. and Perl, Y. Constructions in combinatorial games with cycles. Coll. Math Societatis János Bolyai 10 (Proc. Intern. Colloq. on Infinite and Finite Sets, Keszthely, Hungary, 1973), vol. 2 (North-Holland, 1975), pp. 667699.
(5)Kac, M.Hugo Steinhaus – a reminiscence and a tribute. Amer. Math. Monthly 81 (1974), p. 577.
(6)Li, S.-Y. R.Sums of Zuchswang games. J. Combinatorial Theory A 21 (1976), 5267.
(7)Shaki, A. S.Algebraic solutions of partizan games with cycles. Math. Proc. Cambridge Phil. Soc. 85 (1979), 227246.
(8)Smith, C. A. B.Graphs and composite games. J. Comb. Theory 1 (1966), 5181.

Strategies for compounds of partizan games

  • Aviezri S. Fraenkel (a1) and Uzi Tassa (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.