The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index; 5 of the 16 sources its claims cite were checked for support.
A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
Open accessAbstract
One program to rule them all: Computers can beat humans at increasingly complex games, including chess and Go. However, these programs are typically constructed for a particular game, exploiting its properties, such as the symmetries of the board on which it is played. Silver et al. developed a program called AlphaZero, which taught itself to play Go, chess, and shogi (a Japanese version of chess) (see the Editorial, and the Perspective by Campbell). AlphaZero managed to beat state-of-the-art programs specializing in these three games. The ability of AlphaZero to adapt to various game rules is a notable step toward achieving a general game-playing system. Science , this issue p. 1140 ; see also pp. 1087 and 1118
Overview
CoChat Summary
TL;DR
AlphaZero is a single reinforcement-learning and MCTS algorithm that, given only game rules, learned superhuman play in chess, shogi, and Go through self-play. It defeated world-champion programs Stockfish, Elmo, and AlphaGo Zero using the same algorithm and network architecture across all three games.
Key findings
- In chess, AlphaZero defeated Stockfish 8, winning 155 games and losing 6 out of 1,000; it also won matches from common human openings and 2016 TCEC opening positions.
- In shogi, AlphaZero defeated Elmo, winning 98.2% of games as black and 91.2% overall; in Go, it defeated AlphaGo Zero, winning 61% of games.
- AlphaZero first outperformed Stockfish after 4 hours (300,000 steps), Elmo after 2 hours (110,000 steps), and AlphaGo Lee after 30 hours (74,000 steps); training ran for 700,000 steps, taking about 9 hours in chess, 12 hours in shogi, and 13 days in Go.
- AlphaZero searched only about 60,000 positions per second in chess and shogi, versus 60 million for Stockfish and 25 million for Elmo, yet still defeated Stockfish with 1/10 thinking time and won 46% against Elmo with 1/100 thinking time.
Methods
- AlphaZero uses a deep neural network \(f_\theta(s)\) that outputs move probabilities \(p\) and a scalar value \(v\), trained by reinforcement learning from self-play starting from random parameters; MCTS uses these outputs to guide search, with 800 simulations per move during training.
- The same algorithm, network architecture, and hyperparameters were used for chess, shogi, and Go, with no domain knowledge except game rules; no opening book, endgame tablebases, or domain-specific heuristics were used.
- Training used 5,000 first-generation TPUs to generate self-play games and 16 second-generation TPUs to train networks; evaluation matches used 3 hours per game plus 15 seconds per move, with opponents on 44 CPU cores and AlphaZero on four first-generation TPUs and 44 CPU cores.
Limitations
- Stated: AlphaZero did not use opening books, endgame tablebases, or domain-specific heuristics; the authors note that some such techniques could further improve performance but were left for future research.
- Stated: hyperparameters were reused across games without game-specific tuning, except for exploration noise and the learning rate schedule; matches against an opening book were low in diversity, and forced randomization increased losses.
- Evident from the text: results cover only three games with separate trained instances, no cross-game transfer is demonstrated, and evaluation compares AlphaZero on TPU hardware against CPU-based opponents, so hardware and time-control differences qualify direct strength comparisons.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
3 Valid · 2 Not valid · 8 Not checked · 43 Own results and interpretations
Every source the paper cites for this claim was checked and supports it.
In the paper
“Apart from the representation of positions and actions described above, AlphaZero uses the same network architecture as AlphaGo Zero ( 9 ), briefly recapitulated here.”
What the sources say
- Supportedcites [9] source
The Neural Network Architecture Comparison (p. 29) identifies AlphaGo Zero’s architecture as a residual tower with policy and value heads. The citation supplies the AlphaGo Zero architecture that the citing authors say AlphaZero uses; the comparison to AlphaZero is their own statement. (LLM, conf=0.88)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“and in Go, AlphaZero first outperformed AlphaGo Lee ( 9 ) after 30 hours (74,000 steps).”
What the sources say
- Partly supportedcites [9] sourceExperimental — accuracy not yet measured
Section 2, p. 7 reports that AlphaGo Zero outperformed AlphaGo Lee, but says this happened after 36 hours, not 30. The passage does not give 74,000 steps, and it names the system AlphaGo Zero rather than AlphaZero. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The training algorithm achieved similar performance in all independent runs (see fig. S3), suggesting that the high performance of AlphaZero's training algorithm is repeatable.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“AlphaZero also defeated Stockfish when given 1 / 10 as much thinking time as its opponent (i.e. searching ~ 1 / 10 , 000 as many positions),”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“and won 46% of games against Elmo when given 1 / 100 as much time (i.e. searching ~ 1 / 40 , 000 as many positions), see Fig. 2.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
23 more claims
Create a free account to see all 56 claims and to verify the 3 references still open.
- Probably not a substantial claim. 10
- It may state two separate claims as one. 23
- The quote only partly states this claim. 1
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Games have historically served as highly effective metrics for evaluating progress in deep reinforcement learning research”
From BALROG: Benchmarking Agentic LLM and VLM Reasoning On Games (2024) · cites this paper as Silver et al., 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In 2017, AlphaGo, using the same learning algorithms in TD-Gammon and a billion times more computing power, soundly beat Ke Jie, the world Go champion, in a game that is to chess what chess is to backgammon in complexity (Silver et al., 2018).”
From Large Language Models and the Reverse Turing Test (2023) · cites this paper as Silver et al., 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Most of the attention was on who won, but more important was how it won: AlphaGo was creative and had discovered new moves and board positions that were outside human experience.”
From Large Language Models and the Reverse Turing Test (2023) · cites this paper as Silver et al., 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The primary method for applying more computation at inference, common in the AlphaZero family of agents2,72, is scaling the tree search and running multiple independent search attempts.”
From Olympiad-level formal mathematical reasoning with reinforcement learning (2026) · cites this paper as [2]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Modern AI can write computer programs (Li et al., 2022) or play chess at super-human level (Silver et al., 2018), but the ability of AI to perceive and act in the world remains far below human level.”
From Scaling Instructable Agents Across Many Simulated Worlds (2024) · cites this paper as Silver et al., 2018
1 more claim about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Self-citationAdvances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
Identity mappings in deep residual networks
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46493-0_38 · Cited by 10,741
Identity Mappings in Deep Residual Networks
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · arXiv · doi:10.48550/arxiv.1603.05027 · Cited by 10,665
Mastering the game of Go without human knowledge
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084
Self-citationIn-Datacenter Performance Analysis of a Tensor Processing Unit
Jouppi, N. P., Young, C., Patil, N., Patterson, D., Agrawal, G., Bajwa, R., Bates, S., Bhatia, S., Boden, N., Borchers, A., et al. (2017) · Proceedings of the 44th Annual International Symposium on Computer Architecture · doi:10.1145/3079856.3080246 · Cited by 4,537
Encyclopedia of Artificial Intelligence
(2009) · IGI Global eBooks · doi:10.4018/978-1-59904-849-9 · Cited by 1,396
Campbell, M., Hoane, A. J., & Hsu, F.-H. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00129-1 · Cited by 1,226
Lim, T.-S., Loh, W.-Y., & Shih, Y.-S. (2000) · Machine Learning · doi:10.1023/a:1007608224229 · Cited by 1,133
An analysis of alpha-beta pruning
Knuth, D. E., & Moore, R. W. (1975) · Artificial Intelligence · doi:10.1016/0004-3702(75)90019-3 · Cited by 1,004
Research works printed but not linked: 7
- C. J. Maddison A. Huang I. Sutskever D. Silver paper presented at the International Conference on Learning Representations 2015 San Diego CA 7 to 9 May 2015.
- D. N. L. Levy M. Newborn How Computers Play Chess (Ishi Press 2009).
- W. Steinitz The Modern Chess Instructor (Edition Olms 1990).
- O. Arenz “Monte Carlo chess ” master’s thesis Technische Universität Darmstadt (2012).
- 10.1023/a:1007634325138 · DOI
- T. Kaneko K. Hoki in Advances in Computer Games – 13th International Conference ACG 2011 Revised Selected Papers Tilburg Netherlands 20 to 22 November 2011 (Springer 2012) pp. 158–169.
- R. Ramanujan A. Sabharwal B. Selman in Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010) Catalina Island CA 8 to 11 July (AUAI Press 2010).
Cited by
Items 3,101–3,200 of 3,622
Namdeo, S., & Nene, M. J. (2024) · Research Square · doi:10.21203/rs.3.rs-4241406/v1
PARADIGM CHANGE IN COGNITIVE SCIENCES
Knyazev, G. G. (2023) · Журнал высшей нервной деятельности им И П Павлова · doi:10.31857/s0044467723010094 · Cited by 2
Reducing Time Steps Needed of Multi-Agent Reinforcement Methods in a Dynamic Navigation Environment
Yi, Z., Golivand, F., & Wescott, B. (2023) · Journal of Student Research · doi:10.47611/jsrhs.v12i4.5683
“…breakthrough in the last decade in their feasibility in the real world, being used to dominate any human player in complex one-on-one games like Go and beat top professional players in dynamic cooperative games like Dota along with many other achievements without preexisting game knowledge [2] [3].”
BackgroundDYNAMIC PROGRAMMING FOR SOLVE THE INVENTORY MANAGEMENT PROBLEM IN LOGISTICS
Fedorov, E., Nechyporenko, О., Neskorodieva, T., & Leshchenko, M. M. (2024) · Computer Systems and Information Technologies · doi:10.31891/csit-2024-1-14 · Cited by 1
Vision Real-Time Simulation Training Platform for Quadrotor
Li, J., Zhang, N., Liu, T., et al. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-1107-9_17
An, G. C., & Cockrell, C. (2024) · PubMed · doi:10.48550/arxiv.2405.05301
Sample-efficient reinforcement learning and its applications
Zheng, H. (2024) · Digital Repository Service (Northeastern University) · doi:10.17760/d20659779
What Are the Capabilities of Artificial Intelligence?
Paaß, G., & Hecker, D. (2023) · Springer eBooks · doi:10.1007/978-3-031-50605-5_2
Yadav, J., & mandhare, P. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4830117
Towards Efficient SOT-Assisted STT-MRAM Cell Switching Using Reinforcement Learning
Ender, J., de Orio, R. L., Gös, W., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-56208-2_7
Perceptual Gestalt at WarPreprint
Li, Z., Tang, N., Gong, S., et al. (2024) · doi:10.31234/osf.io/j9ze2
EK-Chess: Chess Learning System Based on Top-Level Chess Expert Knowledge Graph
Zhang, M., Jin, Q., Dong, Q., Wang, D., & Xie, J. (2024) · International Journal of Human-Computer Interaction · doi:10.1080/10447318.2024.2348229 · Cited by 2
“In 2017, AlphaZero (Silver et al., 2018) based solely on the rules of chess, defeated the traditional top-tier chess engine Stockfish (Stockfish, 2023), marking a new era in the development if artificial intelligence in chess.”
Proposal and generation of endgame puzzles for an imperfect information game Geister
Hsueh, C.-H., Ishii, T., Hashimoto, T., & Ikeda, K. (2024) · Entertainment Computing · doi:10.1016/j.entcom.2024.100736
A machine learning ride in the physics theme park: from quantum to biophysics
Requena, B. (2024) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-409132
A No-Code Automated Machine Learning Platform for the Energy Sector
Avcı, E. (2024) · Gazi University Journal of Science Part A Engineering and Innovation · doi:10.54287/gujsa.1473782
The Luckiest Network Gives the Average Error on Disjoint Tests: Experiments
Wu, X., & Weng, J. (2024) · International Conference on Artificial Intelligence in Electronics Engineering (AIEE) · doi:10.1145/3658835.3658839 · Cited by 2
“They include AlexNet [13], AlphaGo Zero [25], AlphaZero [24], AlphaFold [23], MuZero [22], IBM Debater [26], ChatGPT, and Bard.”
BackgroundIs "Deep Learning" Fraudulent in Statistics?
Weng, J. (2024) · International Conference on Artificial Intelligence in Electronics Engineering (AIEE) · doi:10.1145/3658835.3658836
Khodadadi, Z., Trpevski, D., Lindroos, R., & Kotaleski, J. H. (2024) · eLife · doi:10.7554/elife.97274.1
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0001
There are no epistemic norms of inquiry
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0005
The Standard Picture revisited
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0010
The argument from minimal criteria
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0006
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0008
(2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.002.0003
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0009
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0007
(2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.002.0004
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0011
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0002
An account of rational inquiry
Thorstad, D. (2024) · Oxford University Press eBooks · doi:10.1093/oso/9780198886143.003.0004
Greenshaw, A. J., Noble, J. M., Kuriansky, J., Sui, J., Cao, B., Li, T., Torous, J. B., & Greiner, R. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-18529-8.00030-5 · Cited by 1
An Almost Deterministic Cooling by Measurements
Yan, J., & Jing, J. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300435
Navigating in a space of game views
Wellman, M. P., & Mayo, K. (2024) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-024-09660-x
“If it extracts the most recent other-agent profile, the procedure corresponds to learning from self play [12].”
AI techniques in board game: A survey
Liu, A. (2024) · Applied and Computational Engineering · doi:10.54254/2755-2721/79/20241297 · Cited by 3
PokerOWL: A Multi-Agent Poker Environment for Implementing and Evaluating Open-World LearningPreprint
Chiu, M., & Kejriwal, M. (2024) · Research Square · doi:10.21203/rs.3.rs-4677706/v1
SF-MCTS: Score Feedback Monte Carlo Tree Search for Digital Curling in Continuous State Space
Xiao, Q., Li, Z., Li, G., Yang, C., Bai, Y., & Li, Y. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-5678-0_7
Henshall, A., & Karaman, S. (2024) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra57147.2024.10610888
“While this approach has been successfully used to achieve superhuman performance in games like Go, Chess, Shogi, Tron, and more [12] [13] [19] [20], the large multiagent action space makes it too inefficient for time-sensitive online use.”
MethodInfluentialLearning About Explainable AI with Very Little Programming
Dodge, J. E., Diawuo, A., Dai, E., & Das, R. K. (2024) · Springer eBooks · doi:10.1007/978-3-031-61290-9_10
Towards General Function Approximation in Nonstationary Reinforcement Learning
Feng, S., Yin, M. Q., Huang, R., et al. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619458
Felizardo, L. K. (2024) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.3.2024.tde-26082024-093343
Boldori, A. (2024) · Journal of Computer Science · doi:10.3844/jcssp.2024.1263.1269
“No materials are used except the ones already used in Silver et al. (2018) "Mastering chess and shogi by self-play with a general reinforcement learning algorithm".”
MethodMJ-DLVAT: A Deep Learning Value Assessment Technique for Mahjong
Ogami, T., Amano, K., & Tsuruoka, Y. (2024) · IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645601
“AI agents that outperform humans have been developed for perfect information games [1], [2], as well as imperfect information games [3]–[7].”
BackgroundInfluence of Perspectives on Human Player Decisions in Board Games Online
Zhang, J. A., & Zhang, S. (2024) · IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645660
“The algorithm behind AlphaGo Zero, which DeepMind terms “AlphaZero”, is adapted to defeat best human players in Shogi [13], which, while simpler than Go, is significantly more complex than Chess [3].”
BackgroundMethodEfficiently Training Neural Networks for Imperfect Information Games by Sampling Information Sets
Bertram, T., Fürnkranz, J., & Müller, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-70893-0_2
A Proposal of Score Distribution Predictive Model in Self-Play Deep Reinforcement Learning
Kagoshima, K., Sakaji, H., & Noda, I. (2024) · Transactions of the Japanese Society for Artificial Intelligence · doi:10.1527/tjsai.39-5_g-o63
Adaptive Skill Selection for Effective Exploration of Action Space
Zhang, H., Huang, Y., Han, W., Xiong, D., Zhang, C., & Yang, Y. (2024) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn60899.2024.10650465 · Cited by 1
Ensemble Probabilistic Model Predictive Safety Certification for Learning-Based Control
Güzelkaya, N., Gronauer, S., & Diepold, K. J. (2024) · IEEE Conference on Industrial Electronics and Applications (ICIEA) · doi:10.1109/iciea61579.2024.10664752 · Cited by 1
“Learning-based control methodologies such as reinforcement learning (RL) have been successfully applied in a variety of complex and dynamic domains [8], [18].”
BackgroundApplying Opponent and Environment Modelling in Decentralised Multi-Agent Reinforcement LearningPreprint
Chernyavskiy, A., Panov, A. I., & Skrynnik, A. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4959804
Ma, Q., & Liu, M. (2024) · Qeios · doi:10.32388/xnmlpd
Progressively Learning to Reach Remote Goals by Continuously Updating Boundary Goals
Shao, M., Zhu, H.-Q., Zhao, D., Han, K., Jiang, F., Liu, S.-H., & Zhang, W. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3428323
“R EINFORCEMENT learning (RL) has been successfully applied in many fields, ranging from traditional Go games [1], [2] and modern video games [3], [4], [5], [6] to recommendation systems [7] and complex robotics tasks [8], [9], [10].”
Automated Theory Substitution Toward Proof-Driven Software Development
Scebold, J., Bond, E., Gray, E., & Ziegler, J. (2024) · IEEE/ACIS International Conference on Software Engineering Research, Management and Applications (SERA) · doi:10.1109/sera61261.2024.10685627
“• MCTS has shown amazing success in game-playing AI agents [11].”
BackgroundAgar, N., Whatley, S., & Weijers, D. (2024) · Library of ethics and applied philosophy · doi:10.1007/978-3-031-68938-3_7
Task-Aware Lipschitz Confidence Data Augmentation in Visual Reinforcement Learning From Images
Wu, B., Wang, H., & Wu, H. (2024) · IEEE International Conference on Multimedia and Expo (ICME) · doi:10.1109/icme57554.2024.10687445
“Reinforcement learning with high-dimensional visual state as inputs (VRL) has been widely used in many fields[1, 2], such as robot control [3], video games [4], and visual navigation [5].”
MethodDeep Reinforcement Learning for Economics: Progress and Challenges
Green, E. A., & Plunkett, E. B. (2023) · ACM SIGecom Exchanges · doi:10.1145/3699814.3699820
“AlphaZero, trained using deep RL, had just been crowned the world’s best player of chess, Go, and Shogi [Silver et al. 2018], and the application to real-world domains seemed imminent.”
MethodData Analytics, Artificial Intelligence, and Machine Learning in Mobility and Vehicle Engineering
Burger, M. (2024) · Lecture notes in statistics · doi:10.1007/978-3-031-66253-9_11
Current AI: A Survey and Critique
Luger, G. F. (2024) · International Journal of Semantic Computing · doi:10.1142/s1793351x25300018
Rao, J., Wang, C., Liu, M., Lei, J., & Giernacki, W. (2024) · International Conference on Machine Learning, Pattern Recognition and Automation Engineering (MLPRAE) · doi:10.1145/3696687.3696712
Safety Verification of Tree-Ensemble Policies via Predicate Abstraction
Jain, C., Cascioli, L., Devos, L., Vinzent, M., Steinmetz, M., Davis, J. J., & Hoffmann, J. (2024) · Frontiers in artificial intelligence and applications · doi:10.3233/faia240614 · Cited by 1
“Learned action policies are gaining traction in AI (e.g., Mnih et al. 2015; Silver et al. 2016, 2018), including in AI planning (Issakkimuthu, Fern, and Tadepalli 2018; Groshev et al. 2018; Garg, Bajpai et al. 2019; Toyer et al. 2020; Karia and Srivastava 2021; St˚ahlberg, Bonet, and Geffner…”
BackgroundWang, W. (2024) · Springer eBooks · doi:10.1007/978-981-97-5333-8_1
Multi-Objective Optimization Based on AlphaZero Method Applied to Connection Games
Chiu, H.-K., Chen, C.-H., & Lin, S. (2024) · IEEE World Conference on Applied Intelligence and Computing (AIC) · doi:10.1109/aic61668.2024.10731063
“Over the subsequent two decades, DeepMind ’ s AlphaGo [2], AlphaGo Zero [3], and AlphaZero [4] not only triumphed over top human Go players but also exhibited the capability for zero-knowledge learning.”
BackgroundGhost Data in Data Quality Management
Yu, H. (2024) · SpringerBriefs in service science · doi:10.1007/978-3-031-71871-7_7
Pareschi, R. (2024) · Springer eBooks · doi:10.1007/978-3-031-69063-1_3
Scalable Procedural Content Generation via Transfer Reinforcement Learning
Müller-Brockhausen, M., Khalifa, A., & Preuß, M. (2024) · Communications in computer and information science · doi:10.1007/978-981-97-9793-6_8
Zhong, X., & Ni, Z. (2024) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2024.3493833
“Among the current successful AI-based stories, many of them are centered by reinforcement learning (RL) [8], [9], [10], [11], [12], [13], [14], [15], a learning mechanism which mimics human learning through exploration and interaction with the environment.”
Ruman, M., & Guy, T. V. (2024) · IEEE Access · doi:10.1109/access.2024.3497589 · Cited by 1
“Generator from source to target task.”
Alcalá, E., & Romero-Cano, V. (2024) · IEEE Access · doi:10.1109/access.2024.3497719 · Cited by 1
A Comparative Study of Continual Backpropagation
Silvestrin, J., Melo, F. S., & Lopes, M. C. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-73500-4_27
Major sources of computational complexity in complex decision-makingPreprint
Drugowitsch, J., & Pouget, A. (2024) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/vw4yr · Cited by 1
Revealing Limitations of ResNet Models for Deep Evaluation in Chess
Zeman, J., & Janků, L. S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-77915-2_2
Golowich, N., Moitra, A., & Rohatgi, D. (2024) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs61266.2024.00117 · Cited by 9
“In many applications, the main challenge is that the state space of the environment is far too large to even write down [22], [25].”
Deep Learning: Introduction and Representations
Luger, G. F. (2024) · Springer eBooks · doi:10.1007/978-3-031-57437-5_17
The Pre-History of Artificial Intelligence
Luger, G. F. (2024) · Springer eBooks · doi:10.1007/978-3-031-57437-5_1 · Cited by 1
Advanced Applications of Symbol-Based AI: Planning and Learning
Luger, G. F. (2024) · Springer eBooks · doi:10.1007/978-3-031-57437-5_11
Exposing Vulnerabilities in PDF Malware Detectors to Evasion Attacks
Yudin, M., Song, Y., Serban, C., & Chadha, R. (2024) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom61039.2024.10773945
Carrera, P. (2024) · Claridades Revista de Filosofía · doi:10.24310/crf.16.2.2024.19654 · Cited by 1
MasterPlan: A Reinforcement Learning Based Scheduler for Archive Storage
Chen, X.-Y., Xu, E., Mo, D., Lu, R., Wu, H., Ding, D., & Xue, G. (2024) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3708542 · Cited by 1
“Nevertheless, imitating the heuristic experience can lead to noise and misidentification [18, 50].”
Machine Learning Assisting Robots
Wagner, M., Daum, M. T. J., Schulze, A., Brandenburg, J. M., Younis, R., Kisilenko, A., Gyenes, B., Mathis-Ullrich, F., Bodenstedt, S., Speidel, S., et al. (2024) · Springer eBooks · doi:10.1007/978-3-031-68574-3_16 · Cited by 1
Constructing effective match strategies for the game of Tavli
Papahristou, N. (2024) · Hellenic Conference on Artificial Intelligence · doi:10.1145/3688671.3688761
Enhancing Bayesian Network Structural Learning with Monte Carlo Tree Search
Laborda, J. D., Torrijos, P., Puerta, J. M., & Gámez, J. A. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-74003-9_32
“Incorporating algorithms like HC in the MCTS evaluations becomes intricate, making it impossible to feasibly run millions or billions of iterations as seen in other MCTS implementations [25,26].”
CAN AI RESIGN AT THE RIGHT TIME IN A GAME OF SHOGI?
Pan, S., & Ida, H. (2024) · Journal of Mathematical Sciences and Informatics · doi:10.46754/jmsi.2024.12.007
“Artificial intelligence (AI) has become increasingly sophisticated, equalling and surpassing peak human performance in a growing number of domains [2, 3].”
Bennett, D., & Gobet, F. R. (2024) · IEEE International Conference on Cognitive Machine Intelligence (CogMI) · doi:10.1109/cogmi62246.2024.00036
The Impact of Artificial Intelligence on Personalized Nutrition and Healthcare Management
Lonkar, S., Sayyad, S. A., & Shastrakar, P. (2024) · doi:10.1109/idicaiei61867.2024.10842769
Learning a Shogi Evaluation Function Using Genetic Algorithms
O'Connor, J., Kosovsky, R., & Brandenburger, B. (2024) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc54092.2024.10830979
“Developed by DeepMind, AlphaZero, and MuZero employs a general reinforcement learning algorithm that learns solely from playing against itself, without any human-derived knowledge [1,2].”
Predicting Property Prices With Machine Learning
Ouchlif, A., Kabba, O., Guendour, M., et al. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-5231-1.ch010
Playing the devil's advocate to bound hidden systematic uncertainties
Hijano, G., Lancierini, D., Marshall, A., et al. (2025) · International Conference on High Energy Physics (ICHEP) · doi:10.22323/1.476.1015
Designing biochemical circuits with tree searchPreprint
Bhamidipati, P. S., & Thomson, M. W. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.01.27.635147 · Cited by 1
“In-122 stead, we iteratively sample from 𝑇 using Monte Carlo tree search (MCTS), an RL algorithm com-123 monly used in MDPs and game-playing artificial intelligences ( Silver et al. ( 2016 , 2017, 2018)) to bound the complexity of searching large decision trees.”
AGENTS: A Historical Perspective 1948-2024Preprint
Alonso, M. N. I. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5067907
Cirl: Leveraging Causal Interventions in Reinforcement Learning to Advance Knowledge Graph ReasoningPreprint
Xia, N. L., Wang, Y., & Luo, X. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5135079
A Continual Learning Method for Facial Recognition Task
Zhang, S., Huang, L., & Li, J. (2024) · International Conference on Electrical, Mechanical and Computer Engineering (ICEMCE) · doi:10.1109/icemce64157.2024.10861965
LLM-Augmented Deep Reinforcement Learning for Complex Task Planning
Du, W., Wang, H., Hao, Z., Wang, C., Song, Y., & Cai, Z. (2024) · China Automation Congress (CAC) · doi:10.1109/cac63892.2024.10864545
An Electronic Countermeasures Methodology Based on Monte Carlo Tree Search and Self-Play
Hu, Z., Jiang, X.-F., Wang, C., Zhou, C.-H., Zeng, W., & Wang, Y. (2024) · 2024 IEEE 7th International Conference on Automation, Electronics and Electrical Engineering (AUTEEE) · doi:10.1109/auteee62881.2024.10869673
“To address this issue, this paper employs a MCTS-based self-play method for evaluating jamming effectiveness[14].”
Design of Reinforcement Learning Environment with Time Sensitive Characteristics
Hu, H., Wang, Z., Zhang, W., Chen, X., Li, B., & Xie, H. (2024) · International Conference on Computer Science, Electronic Information Engineering and Intelligent Control Technology (CEI) · doi:10.1109/cei63587.2024.10871476
Insights on Improving Reasoning and Increasing Capabilities in Large Language Models
Krisshna, S. V., & Sendhil, R. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-97-8090-7_45
Liu, S. T., & He, Z. (2024) · International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI) · doi:10.1109/cisp-bmei64163.2024.10906115
Multi-level Knowledge Distillation for Class Incremental Learning
Hu, Y., Liu, M., Jiang, H., Feng, L., & Yin, B. (2025) · Communications in computer and information science · doi:10.1007/978-981-96-2681-6_21
A 77.79 GOPs/W Retentive Network FPGA Inference Accelerator with Optimized Workload
Nian, C., Zhang, W., Farrukh, F. U. D., Niu, L., Jiang, D., Chen, F., & Zhang, C. (2024) · Annual Conference of the IEEE Industrial Electronics Society (IECON) · doi:10.1109/iecon55916.2024.10905965
“Deep Neural Networks (DNNs) are useful computational models and lead to advancements in various realms of machine learning and artificial intelligence, such as Computer Vision(CV) [1], Natural Language Processing (NLP) [2], Speech Recognition [3], and Reinforcement Learning [4].”
BoxesZero: An Efficient and Computationally Frugal Dots-and-Boxes Agent
Niu, X., Liu, Q., Chen, W., Zheng, Y., & Jin, Z. (2025) · Entropy · doi:10.3390/e27030285
“These algorithms ingeniously integrate deep neural networks with Monte Carlo Tree Search (MCTS) [10,11], demonstrating superhuman performance in classic board games like Go, chess [12,13], and shogi [14].”
A Brief Overview of Social Dilemmas: From Social Sciences to Multiagent Based Simulations
Cheang, R. M., Brandão, A. A. F., & Sichman, J. S. (2021) · doi:10.5753/wesaac.2021.33407
Similar failures of consideration arise in human and machine planning
Zhang, A., Langenkamp, M., Max Kleiman-weiner, A., Oikarinen, T., & Cushman, F. A. (2025) · Cognition · doi:10.1016/j.cognition.2025.106108
“A random simulation strategy is shared by other Monte-Carlo methods, including Monte-Carlo tree search which was featured in AlphaGo (Silver et al., 2018).”
InfluentialAdapting the AlphaZero Algorithm to Pawn Dama: Implementation, Training, and Performance Evaluation
Baran, M. K., Pehlivanlar, E., Güleç, C., Gönül, A., & Şeramet, M. (2025) · International Journal of Advances in Engineering and Pure Sciences · doi:10.7240/jeps.1620319
Metadata
- Authors
- Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., Lillicrap, T., Simonyan, K., & Hassabis, D.
- Affiliations
- Google DeepMind (United Kingdom) (GB)
- Corresponding author
- Silver, David
- Hubert, Thomas
- Schrittwieser, Julian
- Hassabis, Demis
- ORCID
- Venue
- Science
- Published
- 2018-12-07
- Volume
- 362
- Issue
- 6419
- Pages
- 1140-1144
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2902907165
- Cited by
- 3,562
- References
- 30
- Citations by year
- 2026: 257 · 2025: 427 · 2024: 512 · 2023: 514 · 2022: 569 · 2021: 546 · 2020: 462 · 2019: 256 · 2018: 13
- FWCI
- 179.89
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- UCL Discovery (University College London) (submittedVersion)
- Funders
- DeepMind
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence Applications
- Keywords
- AlphaZero, chess, shogi, Go, evaluation function learning, game tree search
- MeSH terms
- Algorithms, Artificial Intelligence, Humans, Reinforcement, Psychology, Software, Video Games
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.