Algebraic solutions of partizan games with cycles
Ahiezer S. Shaki · Mathematical Proceedings of the Cambridge Philosophical Society · 1979
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.