Strategies for compounds of partizan games
Aviezri S. Fraenkel, Uzi Tassa · Mathematical Proceedings of the Cambridge Philosophical Society · 1982
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.