alt Hacker NewsSurprised it didn’t mention until the very end, but since chess is deterministic, there is no objective probability.
Every position is objectively plus infinity, minus infinity, or zero.
The “advantage” is an engine-specific notion that helps prune search paths.
Some chess engines don’t even evaluate an advantage.
Replies
TZubiri • today at 4:31 PM
Not only it is mentioned, but it's mentioned that it was mentioned as early as 1950, by none other than Claude Shannon:
>""under perfect play all chess games be a the same single one outcome of the following (we just currently don’t know which one, “A” playing the white pieces): Mr. A says, “I resign” or Mr. B says, “I resign” or Mr. A says, “I offer a draw,” and Mr. B replies, “I accept"
There are also objective measures for more fine position evaluation.
For winning/drawn positions: "What is the smallest program that can guarantee your side to win/draw" probably adding some time constraint.