|
|
|
|
|
|
by charcircuit
1159 days ago
|
|
|
>in theory know every possible outcome Does your theory model the maximum possible compute of a player and the amount of time they have to spend computing these outcomes on a turn? People have a finite amount of time to make moves or they lose. Even computers can't explore the full search space. Trivializing the combinatorial explosion of each move is not useful for a chess strategy. |
|
|