This has bugged me for a bit. If chess engines are meant to always play the best moves, then how come two chess engines playing against each other doesn’t always have the same winner?
In: Other
This is venturing into chaos theory… where increased complexity and amount of factors can skew probability of outcome
You cannot control for every factor, even if you are talking about computers. I would guess when the engines play there are times, when different moves yield the same benefit or have the same amount of loss and than the engine randomly chooses a move. Unfortunately there is no such thing as random in computing, computing a true random is impossible, computer randoms are predictible to a certain degree.
Randomness is kind of contriary to computers, because computers are built on being predictible… and random is not predictible
—-
Here is a great video about random
[https://www.youtube.com/watch?v=1cUUfMeOijg](https://www.youtube.com/watch?v=1cUUfMeOijg)
Latest Answers