Article contents
Strategies for compounds of partizan games
Published online by Cambridge University Press: 24 October 2008
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.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 92 , Issue 2 , September 1982 , pp. 193 - 204
- Copyright
- Copyright © Cambridge Philosophical Society 1982
References
REFERENCES
- 4
- Cited by