Computing a perfect strategy for n x n chess requires time exponential in n
Computing a perfect strategy for n x n chess requires time exponential in n
Details
- OL Work ID
- OL6303946W
Subjects
Combinatorial analysisComputational complexityComputer chessData processingGame theory