Skip to content
Back to the collection

Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm

David Silver, Thomas Hubert, Julian Schrittwieser

Show all 13 authors

Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, Demis Hassabis

2017 · arXiv

Read the paper
HN score
0
Mentions
11
Readers
11
Months
9
What’s in a score?

From the abstract

The game of chess is the most widely-studied domain in the history of artificial intelligence. The strongest programs are based on a combination of sophisticated search techniques, domain-specific adaptations, and handcrafted evaluation functions that have been refined by human experts over several decades. In contrast, the AlphaGo Zero program recently achieved superhuman performance in the game of Go, by tabula rasa reinforcement learning from games of self-play. In this paper, we generalise this approach into a single AlphaZero algorithm that can achieve, tabula rasa, superhuman performance in many challenging domains. Starting from random play, and given no domain knowledge except the game rules, AlphaZero achieved within 24 hours a superhuman level of play in the games of chess and shogi (Japanese chess) as well as Go, and convincingly defeated a world-champion program in each case.

Metadata: arXiv. Abstracts retain their original authors’ rights.

In the conversation

Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels

11 selected excerpts · 11 total mentions

dmurray
Neutral mention · rule
It's exactly at the level I thought was communicated by the title and introduction. "Human level competitive", "solidly amateur-level human performance", "beat 100% of beginners and 55% of intermediate players". That robot would definitely win some games in your local club league, except that it doesn't serve, and unless it's cheating in ways the announcement glosses over like extra cameras - DeepMind have some history here so I reserve the right to be skeptical. The only thing I'd take issue with in the abstract is "Table tennis... requires human players to undergo years of training to achieve an advanced level of proficiency." While that sentence is true, it's…
Read the full comment
irrelevant to this robot since this robot only plays at intermediate proficiency, a level reachable by a moderately athletic human with some practice. By contrast, the AlphaGo [0] AlphaZero [1] and AlphaStar [2] papers claim "mastery", "superhuman", "world champion level", "Grandmaster-level", "human professional" ability - all defensible claims given their performance and match conditions in the respective games. [0] https://www.researchgate.net/publication/292074166_Mastering... [1] https://arxiv.org/pdf/1712.01815 [2] https://www.nature.com/articles/s41586-019-1724-z
dargscisyhp
Neutral mention · rule
I thought the AlphaZero paper was pretty cool: https://arxiv.org/abs/1712.01815 Not only did we get a whole new type of Chess engine, it was also interesting to see how the engine thought of different openings at various stages in its training. For instance, the Caro-Kann, which is my weapon of choice, was favored quite heavily by it for several hours and then seemingly rejected (perhaps it even refuted it?!) near the end.
sillysaurusx
Neutral mention · rule
According to the AlphaZero paper (https://arxiv.org/pdf/1712.01815.pdf) they ran game logic on TPUs: > Training proceeded for 700,000 steps (mini-batches of size 4,096) starting from randomly initialised parameters, using 5,000 first-generation TPUs to generate self-play games and 64 second-generation TPUs to train the neural networks. Further details of the training procedure are provided in the Methods.
SideQuark
Neutral mention · rule
>alphazero's loss function never changed Yes, it did. Alpha zero's loss function changes with every update. The loss function works on the actual outcome versus the predicted outcome, and the predicted outcome is a result of previous learning. So with every step it takes, which are random (and the initial weights are also random), it modifies it's own loss function for future walks in the space of weights. Rerun the entire training with different initial random weights, and look at the sequence of loss functions, and you will get a different sequence. The paper: https://arxiv.org/pdf/1712.01815.pdf
tastroder
Neutral mention · rule
Not working in this area but the abstract of the AlphaZero paper [0] seems to disagree about your /any prior knowledge/ point: "Starting from random play, and given no domain knowledge except the game rules, AlphaZero achieved within 24 hours a superhuman level of play in the games of chess and shogi (Japanese chess) as well as Go, and convincingly defeated a world-champion program in each case." [0] https://arxiv.org/abs/1712.01815
yorwba
Neutral mention · rule
I'm curious why you believe to be able to tell that my comment is not accurate when you yourself admit that you have no idea about deep learning? Note that I'm not saying that Google is doing something stupid or leaving potential gains on the table. What I'm saying is that their methods make sense when you are able to perform enough experiments to actually make data-driven decisions. There is just no way to emulate that when you don't even have the budget to try more than one value for some hyperparameters. And since you mentioned chess: The paper https://arxiv.org/pdf/1712.01815.pdf doesn't go into detail about hyperparameter tuning, but does say that they used Bayesian optimization. Although that's better than brute force, AFAIK its sample complexity is still exponential in the number of parameters.
nealeratzlaff
Neutral mention · rule
I think for most people that hurdle of understanding is immense, and isn't likely to get any better. ML/DL infrastructure will continue to improve and deploying AI systems will become more accessible as time goes on. But I don't see familiarity with (non) convex optimization, statistical learning, topology, etc. becoming mainstream. Without these its hard to see a reasonable path forward for AI. For me this year in DL was a lot narrower. it mostly revolved around systems becoming more human in capability. I think most of this is in the article already: We can now hopefully say that ImageNet has been solved. AlphaZero tackled structured games with a single algorithm…
Read the full comment
[1]. Tacotron2 produced completely passible TTS [2] GANs improved dramatically and saw some good theory to back it up [3] [4]. We also started to care more about how well our models do in general, which to me shows maturity: Adversarial examples showed their teeth, and hopefully convinced everyone to care about robust models [5] [6]. Reinforcement learning algorithms were shown to have poor transferability [7]. In 2018 I hope to see a new kind of CNN. Residual style networks are the norm now, since they mostly solve problems with gradient flow. But take away all the skip connections and we're mostly left with a vgg-style linear net with box filters. I'd be really excited to see a network with image-sized conv filters that could adapt their shape (and therefore representational power) to a given feature or signal. Hopefully 2018 is the year where people stop calling AI a one-trick-pony. I don't hear it as often these days, but I think its time to put that phrase to rest. [1] https://arxiv.org/abs/1712.01815 [2] https://research.googleblog.com/2017/12/tacotron-2-generatin... [3] https://arxiv.org/abs/1710.10196 [4] https://arxiv.org/abs/1701.04862 [5] https://arxiv.org/abs/1707.07397 [6] https://arxiv.org/abs/1710.06081 [7] https://arxiv.org/abs/1709.06560
beefman
Neutral mention · rule
Programming languages Slepak et al - An Array-Oriented Language with Static Rank Polymorphism [1] Distributed systems Kiayias et al - A Provably Secure Proof-of-Stake Blockchain Protocol [2] Cognitive computing Boahen - A Neuromorph's Prospectus [3] Machine learning Silver et al - Mastering Chess and Shogi [4] 1 http://www.ccs.neu.edu/home/shivers/papers/rank-polymorphism... 2 https://eprint.iacr.org/2016/889.pdf 3 https://pdfs.semanticscholar.org/3767/1e53c9949fa08d9dc150ad... 4 https://arxiv.org/pdf/1712.01815.pdf
vatueil
Neutral mention · rule
Interesting information on reasons for choosing a 1GB hash size, thanks. > A0 should have let Stockfish use its opening book though. Has it been confirmed that it didn't? As far as I can tell, DeepMind never said that Stockfish didn't use an opening book or endgame tablebase, only that AlphaZero didn't: https://twitter.com/demishassabis/status/938347604462542849 The only time opening books are mentioned in the arxiv paper is when they are described as standard components of chess engines; while it doesn't explicitly state whether Stockfish was allowed to use them in the tests, I would think it likely: https://arxiv.org/abs/1712.01815 The rumor that Stockfish didn't have an opening book seems widespread but unsourced.

Keep following the thread.

More in Machine learning

More from the same topics.

2018arXiv

Talent vs Luck: the role of randomness in success and failure

A. Pluchino. A. E. Biondo, A. Rapisarda

The largely dominant meritocratic paradigm of highly competitive Western cultures is rooted on the belief that success is due mainly, if not exclusively, to personal qualities such as talent, intelligence, skills, efforts or risk taking.

16 mentions14 months
2.5HN score