Abstract
A position in a disjunctive sum of games is simply a collection of positions, one from each game: to move in a sum is to move in any one of its constituents. Sums have been studied extensively by Conway and others, and play an important rÔle in Go.
It is shown that the problem of best play in a sum of trivial games is polynomial space complete. Hence it may be conjectured that there is no feasible algorithm for deriving a strategy of play in a sum from knowledge about its constituent games.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Conway, J.H.: On Numbers and Games. London 1976.
Even, S., andR.E. Tarjan: A combinatorial problem which is complete in polynomial space. J. Assoc. Comput. Mach.23 (4), 1976, 710–719.
Fraenkel, A.S., M.R. Garey, D.S. Johnson, T. Schaefer andY. Yesha: The complexity of checkers on anN×N board — preliminary report. Proc. 19th Ann. Symp. on Foundations of Computer Science, IEEE Computer Society. Long Beach 1978.
Garey, M.R., andD.S. Johnson: Computers and Intractability: A Guide to the Theory of NP Completeness. San Francisco 1979.
Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations. Ed. by R.E. Miller and J.W. Thatcher. New York 1972.
Lichtenstein, D., andM. Sipser: Go is polynomial-space hard. J. Assoc. Comput. Mach.27 (2), 1980, 393–401.
Stockmeyer, L.J., andA.R. Meyer: Word problems requiring exponential time. Proc. 5th Ann. ACM Symp. on Theory of Computing. New York 1973.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Morris, F.L. Playing disjunctive sums is polynomial space complete. Int J Game Theory 10, 195–205 (1981). https://doi.org/10.1007/BF01755964
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01755964