Hostname: page-component-5c6d5d7d68-vt8vv Total loading time: 0.001 Render date: 2024-08-16T02:33:28.530Z Has data issue: false hasContentIssue false
  • English
  • Français

Algebraic solutions of partizan games with cycles

Published online by Cambridge University Press:  24 October 2008

Ahiezer S. Shaki
Ahiezer S. Shaki
Affiliation:
Department of Mathematics, Bar-Ilan University, Ramat-Gan, Israel
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper presents an algebraic model for a general class of two-person perfect-information partizan games which may contain cycles, i.e. sequences of positions that may be assumed more than once. An algorithm is given for determining the winning, losing and tie-positions of disjunctive compounds of partizan games.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 85 , Issue 2 , March 1979 , pp. 227 - 246
Copyright
Copyright © Cambridge Philosophical Society 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Conway, J. H.On numbers and games (Academic Press, 1976).Google Scholar
(2)Li, Shuo-Yen R.Sums of Zuchswang games. J. Combinatorial Theory, Ser. A 21 (1976), 52–67.CrossRefGoogle Scholar