Isn’t chess a “finite” game where no luck is involved? Are computers able to calculate perfect strategies for both players?
And if yes, then which side is at the advantage?
In: 11
For a long time there was a big argument over whether chess is a win for white or a draw. Nowadays we think it’s a draw because better and better computers are drawing each other more and more often.
This doesn’t mean that it’s definitely a draw though. Lots of things in maths have a surprising outcomes when they reach their perfect or optimal state. For example, the sum of 1+1+1+1… Is infinite, but if you ever stop it, it’s finite. Something similar could be true for chess; near perfect play is a draw, but perfect play is a win.
I think it’s a draw. But I can’t prove it, and it’s unlikely if not impossible we ever will.
Latest Answers