AlphaZero beat Stockfish twice, under different rules each time
Everyone quotes the one-minute-per-move match from the 2017 preprint, not the peer-reviewed 1000-game rematch that gave Stockfish tournament time and still ended 155 to 6.
Why this matters
AlphaZero is the paper people reach for when they say an AI taught itself a hard skill from nothing but the rules, and it stands behind the same claim now made about systems that learn to reason. It is worth knowing what that self-teaching actually did, and what the result that made it famous rested on. This lesson walks through what AlphaZero learned and how, the exact conditions of the chess match it is quoted for, and which parts of the story have held up in the years since.
- 01
- AlphaGo's Nature paper never mentions Lee Sedol: the predecessor that learned Go from human games before AlphaZero dropped them.
- 02
- Rich Sutton's essay has four examples and zero citations: the argument that search and learning beat hand-built knowledge, which AlphaZero is cited to support.
One network, no human games
In December 2018, a team at DeepMind reported in Science that a single program had taught itself chess, shogi and Go and reached a level above the strongest existing programs in each, starting from nothing but the rules.1
The program was AlphaZero. It was given the legal moves and the win, loss and draw conditions of a game, and nothing more. It had no database of human games and no library of studied openings. It had no evaluation function either, the hand-written scoring of a position that chess engines had always used. It improved by playing millions of games against copies of itself, a method called self-play reinforcement learning, in which the only teacher is the final result of each game, fed back to adjust the network that picks the moves.1
One neural network estimated, for any position, both which moves looked worth considering and who was likely to win. A general search procedure, Monte Carlo tree search, then read a short way down the most promising lines before the program committed to a move. This is the step past AlphaGo, the earlier DeepMind system that first learned Go from recorded human games and only then improved by self-play. AlphaZero dropped the human data altogether.
Nine hours of chess, thirteen days of Go
Training was quick in wall-clock time and heavy in hardware. Full training ran about nine hours for chess, twelve for shogi and thirteen days for Go, each over 700,000 update steps on batches of 4,096 positions.1 AlphaZero first climbed past Stockfish's level in chess after four hours, and past the shogi engine Elmo after two.1 The compute behind those hours was large: 5,000 first-generation tensor processing units, Google's custom chips for this kind of work, generated the self-play games, and 16 second-generation TPUs trained the network.1
The results were one-sided. Over 1000 games of chess it beat Stockfish, winning 155, losing 6 and drawing 839.1 In shogi it scored 91.2% against Elmo, and in Go it won 61% of its games against an earlier version of AlphaGo Zero.1
The chess figure is more lopsided as a headline than as a contest. Almost all of AlphaZero's wins came with the white pieces, which move first. Playing black, it won 2% of its games and drew 97%.1 It also reached this while searching far less than its opponent. Stockfish examined about 60 million positions a second; AlphaZero examined about 60,000, roughly a thousandth as many, and chose among them with the network rather than by raw count.1
The two Stockfish matches
The chess result is the one that travels, and it is usually quoted with the wrong conditions attached. There are two AlphaZero papers, and they describe two different chess matches.12
The conditions people repeat come from the first paper, a preprint posted in December 2017.2 That match was 100 games at a fixed one minute per move, against Stockfish 8 running on 64 threads with a one-gigabyte hash table and no opening book, while AlphaZero ran on four TPUs. AlphaZero won 28, drew 72 and lost none.2
Strong players and Stockfish's own authors said those conditions made the score hard to read. Tord Romstad, one of Stockfish's original authors, called it a "rather strange choice of time controls", noting that the one-minute limit denied the engine the time-management it normally uses and that the version tested was a year old.3 He summed the mismatch up as "apples to orangutans".3 The grandmasters Hikaru Nakamura and Larry Kaufman objected most to Stockfish playing without its opening book, the stored library of studied first moves that a top engine leans on.4
The peer-reviewed paper, published in Science a year later and the version the field treats as the record, ran a different and harder match. It was 1000 games at three hours each plus 15 seconds a move, against Stockfish in its 44-core tournament configuration.1 The authors added separate matches against the newest Stockfish development build available in January 2018 and against a Stockfish given a strong opening book, and AlphaZero won those too. It still won when handed a tenth of Stockfish's thinking time.1 Reporting at the time judged that the realistic time control had removed one of the biggest objections to the 2017 match.5
| Condition | 2017 preprint | 2018 Science |
|---|---|---|
| Games | 100 | 1 000 |
| Time control | 1 min / move | 3 h + 15 s / move |
| Stockfish setup | v8, 64 threads, 1 GB hash | v8, 44 CPU cores |
| Opening book | none | none, plus a separate book match |
| Result (W / D / L) | 28 / 72 / 0 | 155 / 839 / 6 |
Answering the 2017 objections did not make the match neutral. The Science account leaves two things standing. The hardware was never put on equal terms. AlphaZero ran on four first-generation TPUs alongside 44 CPU cores, Stockfish on 44 CPU cores alone. DeepMind itself describes a TPU as "roughly similar" in speed to an NVIDIA Titan V graphics card, while adding that the two architectures are "not directly comparable".6 And the opponent was still Stockfish 8, in a match DeepMind ran in-house rather than in an independent tournament.1
Neither paper's main text says whether Stockfish was given its endgame tablebases, the precomputed tables of perfect play for positions with only a few pieces left that a top engine usually consults. Every other condition is spelled out, so this one is read from silence rather than reported either way.12
The method reproduced, then Stockfish caught up
Two claims come out of AlphaZero, and they have aged differently. The first is that one algorithm, unchanged, learned three very different games to a top level from their rules alone.1 That claim was never seriously contested, and it is why AlphaZero is cited well beyond chess, as evidence that a general learning method paired with search can stand in for hand-built expertise.
The second claim, that AlphaZero was simply the stronger chess player than Stockfish, rested on a disputed match that DeepMind ran itself. Confirmation from outside DeepMind came later. Leela Chess Zero is an open-source project that rebuilt the AlphaZero method, learning chess from self-play with a neural network.7 In May 2019 it beat Stockfish in the Season 15 superfinal of the Top Chess Engine Championship, scoring 14 wins to 7 with 79 draws under standard tournament conditions.8 The method reproduced.
What lasted is a change in method rather than a ranking. In 2020 Stockfish added a trained network of its own to its evaluation, called NNUE, which made it at least 80 Elo stronger than the hand-written version, and it went on to retake the top of the same championship.9 Scoring a position with a trained network, guided by search, beat the old hand-tuned approach so plainly that the strongest hand-tuned engine adopted a network too.
- One algorithm learned chess, shogi and Go from the rules alone, with no human games and no hand-written evaluation.
- The self-play method reproduced outside DeepMind: an open-source engine built on it beat Stockfish in an independent tournament.
- The famous strength margin came from DeepMind's own match, on hardware the comparison never equalised, against a since-superseded Stockfish.
- The ranking did not last. Stockfish adopted a trained evaluation of its own and retook the top.
The takeaway
AlphaZero's real achievement is the general one. The same program, given only the rules, reached the top of three different games by playing itself, with no human games and no hand-written scoring. The chess win over Stockfish that made headlines is true but conditional. The most-quoted conditions, one minute a move and no opening book, belong to the 2017 preprint. The peer-reviewed match gave Stockfish tournament time and still won, though on unequal hardware and against a version soon overtaken. When someone cites AlphaZero as proof that it beat the best chess engine for good, that is the part to check. The method spread; the ranking did not stay.
- 01
- The AlphaZero preprint (Silver et al., 2017): the first-published version, with the one-minute-per-move match in full.
- 02
- DeepMind's own write-up: the results and the hardware note explained for a general reader.
Sources
- Science · Silver et al., A general reinforcement-learning algorithm that masters chess, shogi and Go through self-play (2018)
- arXiv · Silver et al., Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm (2017)
- Lichess forum · Tord Romstad (Stockfish author), statement on the 2017 match, reposted verbatim
- Chess.com · Mike Klein, Google's AlphaZero Destroys Stockfish In 100-Game Match (2017)
- Chess.com · Updated AlphaZero Crushes Stockfish In New 1,000-Game Match (2019)
- DeepMind · AlphaZero: Shedding new light on chess, shogi, and Go
- Leela Chess Zero · Project description
- Chess Programming Wiki · Leela Chess Zero, TCEC Season 15 superfinal record
- Chess Programming Wiki · Stockfish NNUE