Skip to main content
Conference ProceedingsOPEN ACCESS

Computing a perfect strategy for n×n chess requires time exponential in n

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1981) 115 LNCS 278-293
DOI: 10.1007/3-540-10843-2_23
14Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is proved that a natural generalization of chess to an n×n board is complete in exponential time. This implies that there exist chess-positions on an n×n chess-board for which the problem of determining who can win from that position requires an amount of time which is at least exponential in n.

Cite

CITATION STYLE

APA

Fraenkel, A. S., & Lichtenstein, D. (1981). Computing a perfect strategy for n×n chess requires time exponential in n. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 115 LNCS, pp. 278–293). Springer Verlag. https://doi.org/10.1007/3-540-10843-2_23

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