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

An edition of Computing a perfect strategy for n x n chess requires time exponential in n (1979)

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

By Aviezri S. Fraenkel

0 (0 Ratings)

0 Want to read0 Currently reading0 Have read

Publish Date

1979

Publisher

Dept. of Computer Science, University of Illinois at Urbana-Champaign

Language

eng

Pages

Description:

subjects: Combinatorial analysis, Computational complexity, Computer chess, Data processing, Game theory