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

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

Work

Year: 1981

Type: article

Source: Journal of Combinatorial Theory Series A

Authors Aviezri S. Fraenkel, David Lichtenstein

Institutions Weizmann Institute of Science, University of California, Berkeley

Cites: 7

Cited by: 173

Related to: 10

FWCI: 3.465

Citation percentile (by year/subfield): 97.79

Topic: Artificial Intelligence in Games

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed