@126
"A random legal move generator will generally produce 100% draws."
++ I do not know that.
SF8 is simulating a random legal move generator in the examples below if you look through them. 100% draws.
It is disrespectful to compare 17 ICCF (grand)masters with engines at 5 days/move in the ICCF World Championship Finals to a random move generator.
Then stop doing it. I made no such comparison.
"They both arrive at 100% draws"
++ The ICCF (grand)masters did not arrive at 100% draws in previous years.
They now reached 100% (except if the ongoing games would produce a decisive game).
Relevance?
"some agreed draws"
++ Yes, they agree on a draw when neither side has no hope of winning. You cannot expect them to play on for months until a 7-men endgame table base draw or a 3-fold repetition.
I already said I don't. Again - relevance?
"A proof that the starting position is a draw that starts by assuming the starting position is a draw could be regarded as circular."
++ No, I start with the hypothesis that chess is not a draw.
Then I demonstrate this hypothesis contradicts the observed facts and thus the hypothesis is false and the contrary of the hypothesis is true.
Indeed you do, so you have no grounds for dismissing the games I posted on page 1 (starting from a winning position) as counterexamples to your "proof". My comment was in response to your objection
++ No. You take a won position and your engine fails to win at its set time/move.I take the drawn initial position and the ICCF (grand)masters with their engines now arrive at reaching 100% draws. Your setup fails to reach the game-theoretical value.
Which suggests your poor befuddled brain is assuming that your argument depends on the initial position being drawn.
"I will post a set of SF v SF games that do reach the game-theoretic value of draw from a Syzygy verifiable drawn position and also contain blunders."
++ But at what time per move?
Your "proof" involves no reference to time per move. Your comments at the start regarding time are just padding; never referred to in you proof. So the question is irrelevant. (But in fact you can run games from the starting position in the games I post here with any feasible time per move - the result will be the same.)
Some previous year ICCF WC Finals at 5 days/move but with less powerful engines and less knowledgeable ICCF (grand)masters ended decisively.
There probably were games with two errors that undid each other.
"In previous years they came closer and closer, but did not yet reach it."
++ That is a fact: the number of decisive games became smaller and smaller and is now zero.
How very interesting. Are you responding to my post?
"The games I'll post will verifiably reach the game theoretic value."
++ If you reach a draw and you have an even number of mistakes that cancel out, then the same procedure will also generate games with 1, 3... errors, i.e. games that do not reach the game theoretic value.
Well, I tried it and they didn't. So yah boo.
On previous years' ICCF WC Finals I used a Poisson distribution to estimate the number of errors from the observed results. Now I no longer need that: they have reached 100% draws.
And it was explained to you at length in previous threads exactly what was wrong with that.
A new set of games starting from a drawn position (unnecessary to prove the point, but just for your benefit.)
10 games 100% drawn.
According to your proof none of the games contain any errors.
In the first game Black's move 1 and White's move 2 are both blunders. I didn't check any further. I'll leave you to check the rest with Syzygy.
Before they get me banned again for nada...