Article contents
Algebraic solutions of partizan games with cycles
Published online by Cambridge University Press: 24 October 2008
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
References
REFERENCES
- 6
- Cited by