what would a computer's arting be at the point where chess is solved?
Sort:
[COMMENT DELETED]
typo should read "rating"....could not edit
My guess was 4200, but somebody told me that it was statistically proven that the top possible rating was 3600....but don't have the reference, so not sure....
it wouldn't have a rating, since rating is for those who play chess and haven't solved it. A computer which solves chess wouldn't be rated, and in the rare case that it is, it would be something close to infinity lol
First of all, computer rating numbers are not meaningful in the sense that we can extrapolate how strong they are compared to humans. We can't look at something like the 3395 rating of Komodo 11 and conclude that it is ~600 rating points stronger than the top human players. That's not how it works. An Elo rating is only a measure of how well it performs in a pool of players and since no humans are competing in the computer pool the numbers can not be related to human playing strength. If the best engine running on a powerful multi CPU setup started playing in elite human tournaments and was given a FIDE rating it would go on a win streak until the experiment was stopped. Its rating would climb forever or until the rating system stopped giving it points because of the rating difference. The 3395 computer rating is a completely arbitrary number in this regard. Since the point of ratings is to predict the outcome in a chess game, and the outcome of Man vs Supercomputer is a guaranteed win for the machine every time it might as well be 33 950.
If engines solved chess then they would never lose a game against each other and their ratings would be identical. It wouldn't be rated 3600, 4400, 4500 or 5000 or any other totally meaningless number because the whole point of a rating is gone.
yeah, it has to broken down to human and non-human.....I was assuming humans would never be able to solve chess because there are too many possibilities, it is beyond our ken.....so that leaves computers playing each other....up to the point where neither computer playing can win because it is technically "solved"....so what is the machine rating at that point???....purely speculative for sure...
I'm assuming that one computer will always be slightly better than the next, until another is invented, etc....so they can keep gaining points until the point at which nether can win...
It's not difficult really. Just replace Chess with Tic Tac toe. With perfect information, and perfect play, every game would be drawn. High ratings only result from a relative position inside of a pool. If there were ELO in Tic Tac Toe, the fact that all games can be drawn would result in a complete compression of the rating pool to being virtually identical. Computers would play other computers, drawing everything, and the result would probably be about whatever the starting ELO is chess is, perhap 1600. If it were just one computer that knew the trick, then the answer is still simple, you'd just have to look it up. Does a GM win any ELO points when he beats a 1200? Nope. So the computer would win every single game until it's rating reached the horizon where Magnus, or Komodo, would be far enough behind that the formula would award no points for a victory. It doesn't matter at this point, if the player is God. Math won't give him any more ELO points. And I think this occurs around 800 or 1000 pts above the opponent? So probably 4400. Maybe closer to 4200.
42