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
Chess is a finite game, meaning there’s a finite number of possible positions and a finite number of unique games. However, even though it’s finite, the number of unique games is unimaginably huge, and it’s far larger than our current computer technology could process in a reasonable amount of time. Like, it might take billions of years for a modern computer to “solve” chess and be able to play it perfectly. It might be solvable, but it’s unlikely that any of us will see it solved in our lifetimes. Which is good, because once a game is solved, it becomes boring and feels pointless to play.
If chess was solved, I’d expect white to win every game. It’s common knowledge that white has a small advantage because they get to move first. If you start with a small advantage and you know how to play perfectly, you’re pretty likely to win. However, winning and losing are not the only possible results of a chess game, you can draw too. It’s possible that black could force a draw with perfect play, even if white plays perfectly too. We won’t know until chess is solved. Don’t hold your breath.
Latest Answers