Which side in chess would win if both players played “perfectly”?

Question

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

Answer 1

Yes it’s finite, but the number of potential games is too big for us to know all of them. Tic tac toe is solved because the number of games is small enough that you can look up the best response to any game. Solving chess would require evaluating every possible board state which there are too many of for that to be doable on current technology. I think we’ve gotten as far as solving every possible combinations of seven pieces though.