@11663
"if a computer checking x number of moves fail to find a win,
how can you know a computer checking x +1 moves would also fail to find a win"
++ Because of redundancy. In the 108 draws out of 108 games of the ongoing ICCF World Championship several ways to draw were found:
108 sequences of legal moves starting from the initial position and ending in draws.
Elroch is trolling with his suggestion that the first moves of all 108 games are wrong and that 1 a4 wins for white. Demanding game trees for 1 a4 or 1 e4 e5 2 Ba6? is not rigor, it is stupid.
Now let us assume some white win would exist after 1 e4.
We have 2 games with 1 e4 e6 2 d4 d5 3 Nc3 that draw.
3 e5 could be a white win (1), so these 2 games would contain 2 errors.
We have 15 games with 1 e4 c5 2 Nf3/Nc3 that draw.
2 c3 could be a white win (2), so these 15 games would contain 2 errors.
We have 6 games with 1 e4 e5 2 Nf3 Nf6 3 Nxe5/d4 that draw.
3 Nc3 could be a white win (3), so these 6 games would contain 2 errors.
We have 15 games with 1 e4 e5 2 Nf3 Nc6 3 Bb5/Bc4 that draw.
3 Nc3 could be a white win (4), so these 15 games would contain 2 errors.
So this would not mean 1 win, but 4 wins to be found and 2 + 15 + 6 + 15 = 38 games to contain 2 errors and all 17 finalists to be wrong.
That would lead to an error distribution of 70 - 0 - 38 - 0 instead of 108 - 0 - 0 - 0
It is not plausible to have 70 games with 0 error and 38 games with 2 errors and 0 with 1 error.
That would require all errors to come in pairs and none unpaired.
There are some arguments for some errors to come in pairs, but not all errors.
Where is the proof to that?
Just because you can "solve " chess doesn't mean you do it correctly
And most of the time the higher the elo you are the better you are than your opponent but not always (proof)
Like go play against stockfish maybe you'll beat it after 900+ games