Yazar
aviezri s fraenkel
4 cilt bulundu.
Cilt sonuçları
![Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n](https://covers.openlibrary.org/b/id/11853549-L.jpg)
Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
Aviezri S. Fraenkel · Dept. of Computer Science, University of Illinois at Urbana-Champaign
14 sayfa · 1979
Chess / Data processing / Combinatorial analysis / Computational complexity / Game theory
Combinatorial Games
Richard K. Guy, Elwyn R. Berlekamp, John Horton Conway, Aviezri S. Fraenkel, Richard J. Nowakowski, Vera Pless · American Mathematical Society
233 sayfa · 1991
Congresses / Combinatorial analysis / Game theory
Computing a perfect strategy for n x n chess requires time exponential in n
Aviezri S. Fraenkel · Dept. of Computer Science, University of Illinois at Urbana-Champaign
14 sayfa · 1979
Combinatorial analysis / Computational complexity / Computer chess / Data processing / Game theory