@6036
"1 error in 10^20 moves at 17 secs. per move on your 10^9 nps machine
(which curiously didn't change when you dropped the time from 60 hours to 17 seconds)."
++ 17 s on the 10^9 NPS engine corresponds to 60 h on the engine of the paper.
The engine AZ in the paper (which is not the one you propose to use) was presumably run on a Google's TPUs. From where did you get the equivalence?
"No reason to restrict yourself to just draws" ++ Yes: only drawn positions are relevant to weakly solving chess: hopping from the initial drawn position to other drawn positions until a 7-men endgame table base draw or a prior 3-fold repetition.
I'm not talking about weakly solving chess - you haven't posted a sensible description of that yet. I'm just talking about your calculations of game-theoretic result and error rates extracted from games played from a position. If they work they should work from all positions.
"or just KRPP vs. KRP positions"
++ Rook endings occur most. Rook endings can be draws despite one pawn down.
A rook ending is a major way for black to achieve the game-theoretic value of the draw.
How is any of that relevant to your calculation?
"one of the positions is a drawn KRPP vs. KRP position anyway."
++ No, see top right in your image: White is winning DTZ 101.
It is a draw only by the 50-moves rule. Black can draw from the initial position without the 50-moves rule, so this position cannot be reached from optimal play by both sides.
The top right of the image gives the game-theoretic result under basic rules.
The games were played with the 50 move rule in force as were the games on which you base your calculations of the error rates you claim as is the game you offer to solve with SF15 which is also designed to play with the 50 move rule in effect. The highlighted text in my image gives the game-theoretic result with the 50 move rule in effect. It's a draw.
The game played at 2048 secs per ply (terminated by adjudication when a six man position was reached) contains two errors under competition rules and only one under basic rules (which is neither of the former). Which type of error rate are you claiming to calculate?
Optimal play has nothing to do with your calculation. It's the validity of the calculation I'm asking you to check. How can you presume to "calculate" error rates on the assumption that there are no errors?
Why don't you stop wriggling and post your calculations for the games here? Then we can stop all this pointless discussion about your proposal to solve chess in five years.
@6036
"1 error in 10^20 moves at 17 secs. per move on your 10^9 nps machine
(which curiously didn't change when you dropped the time from 60 hours to 17 seconds)."
++ 17 s on the 10^9 NPS engine corresponds to 60 h on the engine of the paper.
"No reason to restrict yourself to just draws" ++ Yes: only drawn positions are relevant to weakly solving chess: hopping from the initial drawn position to other drawn positions until a 7-men endgame table base draw or a prior 3-fold repetition.
"or just KRPP vs. KRP positions"
++ Rook endings occur most. Rook endings can be draws despite one pawn down.
A rook ending is a major way for black to achieve the game-theoretic value of the draw.
"one of the positions is a drawn KRPP vs. KRP position anyway."
++ No, see top right in your image: White is winning DTZ 101.
It is a draw only by the 50-moves rule. Black can draw from the initial position without the 50-moves rule, so this position cannot be reached from optimal play by both sides.