On the complexity of some two-person perfect-information games

130Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

We present a number of two-person games, based on simple combinatorial ideas, for which the problem of deciding whether the first player can win is complete in polynomial space. This provides strong evidence, although not absolute proof, that efficient general algorithms for deciding the winner of these games do not exist. The existence of a polynomial-time algorithm for deciding any one of these games would imply the unexpected result that polynomial-time algorithms exist for (a) all the rest of these games, (b) all NP-complete problems and (c) in general, any problem decidable by a polynomial tape bounded Turing machine. © 1978.

Cite

CITATION STYLE

APA

Schaefer, T. J. (1978). On the complexity of some two-person perfect-information games. Journal of Computer and System Sciences, 16(2), 185–225. https://doi.org/10.1016/0022-0000(78)90045-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free