Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n![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](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
Details
- OL Work ID
- OL24938019W
Subjects
ChessData processingCombinatorial analysisComputational complexityGame theory