1

AlphaZero lost 6 games to Stockfish in a 1000-game match from the starting position, at least one of which was with the white pieces: A game A0 lost with white. For some reason, these games haven't received much media attention. Does this mean AlphaZero hasn't solved the game of chess yet? So, there is still scope for improvement? The media's report that AlphaZero is the perfect chess-playing machine is false.

  • 12
    What exactly led you to believe that it had "solved chess"? I don't think any serious source has made such a bold claim. In fact, AlphaZero likely isn't even close to solving chess, even if one only means "solving" in a probabilistic sense rather than the strictest sense. – ATLPoly Dec 10 '18 at 18:21
  • 1
    The title seems to not match the question at all. I'd recommend rephrasing it, maybe to something like "Has alpha zero solved chess?". – Isac Dec 11 '18 at 18:30
8

AlphaZero hasn't solved chess, and it won't until it can find a strategy that results in the same outcome of the game given perfect play from both sides. According to Wikipedia:

A solved game is a game whose outcome (win, lose or draw) can be correctly predicted from any position, assuming that both players play perfectly.

Since AlphaZero has lost games to Stockfish with both colours, we can assure it didn't solve the game. AlphaZero plays itself in training games. Had it solved the game, all these AlphaZero vs AlphaZero games will end up in one same result: either a win for white, a win for black or a draw.

2

There is no such thing as perfect playing machine in chess. Google never claimed their engine was able to solve the game.

  • The only difference between tic-tac-toe and chess is complexity, and we do have perfect playing machines for the former. – Thomas Dec 11 '18 at 2:51
  • @Thomas This is a chess site (please read the FAQ), I was obviously talking about chess. I edited my answer, are you happy now? – SmallChess Dec 11 '18 at 2:52
  • 4
    I don't think this answer is good. There is such a thing as a perfect playing machine in chess - a 32-man tablebase - it's just not feasible to achieve with current technology and would be almost impossible to store anyway. But yes, Google never claimed AlphaZero has solved chess. – Allure Dec 11 '18 at 10:34
  • 2
    @Allure if u can’t build it then it’s not. – SmallChess Dec 11 '18 at 10:38
1

AlphaZero hasn't solved chess - to do so you'd need to know from the starting position which side wins (or if the game is a draw). This is in principle doable with a 32-piece tablebase, but in practice it's impossible.

“Yes,” replied God, “I have done the 32-piece endgame.”

“Ahh,” said Garry, “Of course that is trivially easy for you.”

“No, no,” said God, “it was really tough. More than 10^35 legal positions — it took the matter from a good-sized planet to store. But let us play. You can have white.”

10^35 is a fantastically large number. If it takes one byte to store one position, one gigabyte is still only 10^9 positions, 26 orders of magnitude off the required number. So no, AlphaZero has not solved chess, and there's no way to do so in the foreseeable future.

Naturally this means there is still scope for improvement. If AlphaZero were a conventional engine its developers would be looking at the openings which it lost to Stockfish, because those indicate that there's something Stockfish understands better than AlphaZero. AlphaZero is a neural network engine however, which makes how to improve it less obvious. I am not an expert on neural networks, but you can follow the development of Leela (which is a reproduction of AlphaZero, based on the paper) on its developer blog.

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.