A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
Open accessThe 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.
Abstract
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 2,901–3,000 of 3,633
Development Of Techniques For Quantitative Analysis Of Lime Flowers
Demianenko, D., Demyanenko, V. G., & Бреусова, С. В. (2016) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.167506
CubeTR: Learning to Solve The Rubiks Cube Using TransformersPreprint
Chasmai, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.06036 · Cited by 3
“Reinforcement learning has seen applications in learning many games like chess, shogi (Silver et al., 2017), hex (Young et al., 2016) and Go (Silver et al., 2018).”
AlphaDDA: game artificial intelligence with dynamic difficulty adjustment using AlphaZero.Preprint
Fujita, K. (2021) · arXiv (Cornell University)
Ojha, R. K., Rao, S., Goel, P., Srivastava, S. K., Kumar, K. H., & Prasad, C. (2021) · International Conference on Smart Electronics and Communication (ICOSEC) · doi:10.1109/icosec51865.2021.9591846
An Efficient System to Collect Data for AI Training on Multi-Category Object Counting Task
Haessel, B., Rahman, M. F. A., Andry, S., & Cenggoro, T. W. (2021) · doi:10.1109/iccsai53272.2021.9609789
Machines and InfluencePreprint
Yadav, S., & Yadav, S. (2021) · arXiv (Cornell University)
Forward Model Learning with an Entity-Based Representation for games
Khameneh, N. Y. (2021) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r3-ssj5-5p93
Reinforcement Learning to Reduce Failures in SOT-MRAM Switching
Ender, J., de Orio, R. L., Fiorentini, S., et al. (2021) · IEEE International Symposium on the Physical and Failure Analysis of Integrated Circuits (IPFA) · doi:10.1109/ipfa53173.2021.9617362
“The ML sub-branch of reinforcement learning (RL) [2] is based on the imitation of the way humans learn, with impressive demonstrations of superior performance in chess or Go [3].”
BackgroundВитальевич, П. В. (2020) · Faculty Opinions – Post-Publication Peer Review of the Biomedical Literature · doi:10.3410/f.736467536.793576385
Learning Intra-group Cooperation in Multi-agent Systems
Liu, W., Liu, S., Yang, J., & Liu, Y. (2021) · International Conference on Mechatronics and Machine Vision in Practice (M2VIP) · doi:10.1109/m2vip49856.2021.9665049
(2021) · Elsevier eBooks · doi:10.1016/b978-0-323-90239-7.00013-4
Playing Geister by Estimating Hidden Information with Deep Reinforcement Learning
Tomoda, K., & Hasebe, K. (2021) · IEEE Conference on Games (CoG) · doi:10.1109/cog52621.2021.9618992 · Cited by 1
“One of the best known such studies on perfect information games is that of Silver et al. [11].”
BackgroundAnalysis of Resource Management Methods Based on Reinforcement Learning
Xing, M., Wang, Z., & Xiao, Z. (2021) · International Conference on High Performance Big Data and Intelligent Systems (HPBD&IS) · doi:10.1109/hpbdis53214.2021.9658350
Schlicht, P. (2021) · Springer eBooks · doi:10.1007/978-3-658-35779-5_29
"Machina ludens". Rzeczywista i wyobrażona historia komputerów szachowych
Piekutowski, P. F. (2021) · Adeptus · doi:10.11649/a.2517
Maximum Entropy Reinforcement Learning in Two-Player Perfect Information Games
Nakayashiki, T., & Kaneko, T. (2021) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci50451.2021.9659991
Le potentiel danger des intelligences surhumaines
Delahaye, J.-P. (2019) · Pour la Science · doi:10.3917/pls.498.0080
Anirbit (2020) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita50056.2020.9245002
GREENE, B. R. (2021) · Flammarion eBooks · doi:10.3917/flam.green.2021.01.0417
Applying the language acquisition model to the solution small language processing tasks
Kachkou, D. I. (2022) · Informatics · doi:10.37661/1816-0301-2022-19-1-96-110
Methods for autonomously decomposing and performing long-horizon sequential decision tasks
Pateria, S. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/155182 · Cited by 1
Jacques Pitrat, l’Intelligence Artificielle et les Jeux
Cazenave, T. (2022) · Revue Ouverte d Intelligence Artificielle · doi:10.5802/roia.22
“Ainsi AlphaGo en 2016 [57] a donné l’année suivante AlphaGo Zero [58] puis Alpha Zero en 2018 [56] qui apprend seul à jouer au Go, aux Échecs et au Shogi avec le même algorithme et qui dépasse ce faisant les joueurs humains”
BackgroundIntegrated Multi-task Agent Architecture with Affect-Like Guided Behavior
Worth, J. B., & Si, M. (2022) · Studies in computational intelligence · doi:10.1007/978-3-030-96993-6_68
Suen, S., Scheinker, D., & Enns, E. A. (2022) · Cambridge University Press eBooks · doi:10.1017/9781108872188.002
Deep Q-learning of global optimizer of multiply model parameters for viscoelastic imagingPreprint
Zhang, H., Wang, K., Zhou, Y., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2204.01844
“Combinations of DL and RL/Q-learning have been successfully implemented to solve complex human activities, for example, AlphaGo [12], [13].”
Notes on the Architecture, League Training and PFSP in AlphaStar
Zhao, J., Zhou, N., & Hong, L. (2021) · International Conference on Intelligent Systems and Knowledge Engineering (ISKE) · doi:10.1109/iske54062.2021.9755350
Salgueiro, A. P., Mateo, I. D., García, A. G., Ripoll, Y. R., & Blanco, I. S. (2022) · Studies in computational intelligence · doi:10.1007/978-3-030-97269-1_18 · Cited by 1
Wharton, K. B. (2022) · Advances in media, entertainment and the arts (AMEA) book series · doi:10.4018/978-1-7998-3844-9.ch001
On the Future of Artificial Intelligence - An Article in Honour of Susan Haack, for Her FestschriftPreprint
Floridi, L. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4007476
On the Complexity of Dark Chinese Chess
Wang, C., & Lu, T. (2022) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc55256.2022.10034182
Visual Explanation on Deep Reinforcement Learning
Hirakawa, T., Yamashita, T., & Fujiyoshi, H. (2022) · Journal of the Robotics Society of Japan · doi:10.7210/jrsj.40.212
Qin, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-8884-6_12
Qin, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-8884-6_1
瀧川一学 (2020) · Denki Kagaku · doi:10.5796/denkikagaku.20-fe0004
Automating Network Operation Centers with Superhuman PerformancePreprint
Altamimi, S., Altamimi, B., Shirmohammadi, S., & Côté, D. (2021) · doi:10.36227/techrxiv.15176175
Blockchain-Enabled Joint Resource Allocation for Virtualized Video Service Functions
Yu, P., Zhao, H., Yang, K., et al. (2022) · Security and Communication Networks · doi:10.1155/2022/4349097
“DRL is widely regarded as an effective method to solve decision-making problems in complex environments [19, 20].”
Wang, Y., & Liu, F. (2022) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac54236.2022.00015
On CVaR-Based Reinforcement Learning in Quantitative InvestmentPreprint
Alameer, A., & Alshehri, K. A. (2022) · doi:10.36227/techrxiv.19961525
The Accidental Philosopher and One of the Hardest Problems in the World
Finnestad, S., & Neufeld, E. M. (2022) · Philosophies · doi:10.3390/philosophies7040076
“It could even be said that, resource requirements aside, AlphaZero handles chess much the way it would handle tic-tac-toe.”
BackgroundInfluentialRobust multi-agent team behaviors in uncertain environment via reinforcement learning
Yan, K. H. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/159448
SC2EGSet: StarCraft II Esport Replay and Game-state DatasetPreprint
Białecki, A., Jakubowska, N., Dobrowolski, P., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2207.03428
Deletoille, G. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4135655
Plaat, A. (2022) · Springer eBooks · doi:10.1007/978-981-19-0638-1_6
Rinascimento: Playing Splendor-Like Games With Event-Value Functions
Bravi, I., & Lucas, S. M. (2022) · IEEE Transactions on Games · doi:10.1109/tg.2022.3171908
Plaat, A. (2022) · Springer eBooks · doi:10.1007/978-981-19-0638-1_10
Multipolar Security Cooperation Planning: A Multiobjective, Adversarial-Risk-Analysis Approach
Caballero, W. N., Gharst, E., Banks, D. L., et al. (2022) · Decision Analysis · doi:10.1287/deca.2022.0458
Machine learning-aided and SAT-aided cryptanalysis of symmetric-key primitives
Tu, Y. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/160785
Growiec, J. (2022) · Frontiers in economic history · doi:10.1007/978-3-031-07195-9_3
Reinforce-lib: A Reinforcement Learning Library for Scientific Research
Anzalone, L., & Bonacorsi, D. (2022) · Proceedings of International Symposium on Grids & Clouds 2022 — PoS(ISGC2022) · doi:10.22323/1.415.0018
Stellenwert der KI im pränatalen sonographischen Screening
Ritgen, J. (2022) · Die Gynäkologie · doi:10.1007/s00129-022-04995-6
“K den Selbstlernen gegen weltbeste menschliche Gegner und auch gegen etablierte Expertensysteme [27].”
BackgroundAcoustic Lens Design Using Machine Learning
Wang, W.-C. (2022) · San José State University ScholarWorks (San Jose State University) · doi:10.31979/etd.hrv8-vpva
Building Machine Learning Bot with ML-Agents in Tank Battle
Dung, V. D., & Hung, P. D. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-16865-9_10
Learning Chess and NIM with Transformers
DeLeo, M., & Guven, E. (2022) · International Journal on Natural Language Computing · doi:10.5121/ijnlc.2022.11501 · Cited by 1
“Alpha Zero is a deep reinforcement learning algorithm with a Monte Carlo Tree Search (MCTS) algorithm as its tree search algorithm [8].”
BackgroundMethodNon-biological ‘Paralife’ and Its Ongoing Transition Toward a New Form of Mechanical LifePreprint
Rice, W. (2022) · Preprints.org · doi:10.20944/preprints202211.0354.v1
Autonomous scene exploration using experience enhancement
夏, 熙., 吴, 关., & 刘, 利. (2022) · Scientia Sinica Informationis · doi:10.1360/ssi-2022-0318
da Silva, E. C. (2022) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.59.2022.tde-22112022-152337
How Democracy Survives: Global Challenges in the Anthropocene
Holm, M., & Deese, R. S. (2022) · Routledge eBooks · doi:10.4324/9781003218586 · Cited by 1
Hawkins, P. N. (2022) · Queensland University of Technology · doi:10.5204/thesis.eprints.236966
Musil, B., & Plohl, N. (2022) · doi:10.18690/um.ff.11.2022.11 · Cited by 1
Umetna inteligenca in eksistenčno tveganje
Lipuš, A. (2022) · doi:10.18690/um.ff.11.2022.10
Borstner, B., & Šetar, N. (2022) · doi:10.18690/um.ff.11.2022.5 · Cited by 5
Od Descartesa do Alexe: filozofski pogled na razvoj umetne inteligence
Bregant, J. (2022) · doi:10.18690/um.ff.11.2022.1 · Cited by 1
Transformacija 'inteligence roja' {Swarm Intelligence} na umetno inteligenco
Martinc, U., Aberšek, B., & Borstner, B. (2022) · doi:10.18690/um.ff.11.2022.9 · Cited by 1
Birds in Boots: Learning to Play Angry Birds with Policy-Guided Search
Pereira, L. V. S., Chaimowicz, L., & Lelis, L. H. S. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v17i1.18893
“2016) and its successor AlphaGo Zero (Silver et al. 2018) also learn to play games from experience.”
BackgroundIntroduction to Optimal Control and Reinforcement Learning
Rizvi, S. A. A., & Lin, Z. (2022) · Control engineering · doi:10.1007/978-3-031-15858-2_1
Effective Planning in Resource-Competition Problems by Task Decomposition
Chrpa, L., Rytíř, P., Nyporko, A., et al. (2022) · Proceedings of the International Symposium on Combinatorial Search · doi:10.1609/socs.v15i1.21751
“Deep Reinforcement Learning (DRL) has shown impressive performance in numerous adversarial domains such as (again) Star-craft (Vinyals et al. 2019) or Go (Silver et al. 2018).”
BackgroundZhang, J., Zhan, M., Qi, S., Yu, N., Zheng, D., Wang, X., & Xiao, J. Z. (2022) · International Conference on Data Intelligence and Security (ICDIS) · doi:10.1109/icdis55630.2022.00071
Use and Abuse of IoT: Challenges and Recommendations
Douglass, R. (2022) · Wiley eBooks · doi:10.1002/9781119892199.ch21
Adversarial Search Algorithms Performance in the Yote Game
Torres, L., & Barriga, N. A. (2022) · IEEE International Conference on Automatica · doi:10.1109/ica-acca56767.2022.10006178
“It has been successfully applied to several board games [18].”
MethodSummerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.003.0008
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.003.0003
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.003.0007
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.003.0002
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.003.0004
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.002.0003
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.002.0004
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.002.0006
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.003.0005
Summerfield, C. (2022) · Oxford University Press eBooks · doi:10.1093/oso/9780192843883.003.0001
Scalable Planning and Learning Framework Development for Swarm-to-Swarm Engagement Problems
Demir, U., Satir, A. S., Goktas, G., et al. (2023) · AIAA SciTech Forum · doi:10.2514/6.2023-1631
Critic-over-Actor-Critic Modeling: Finding Optimal Strategy in ICU Environments
Ryan, R., & Shao, M. (2022) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata55660.2022.10021125 · Cited by 1
“With Atari games [2], Go [3], continuous control tasks [4], it has shown human-like performance.”
BackgroundSatô, T. (2022) · Journal of the Japan Society of Applied Electromagnetics and Mechanics · doi:10.14243/jsaem.30.379
Xu, R. (2022) · Digital Repository Service (Northeastern University) · doi:10.17760/d20467228
The Intelligent, the Artificial, and the Random
Winands, M. H. M. (2022) · Research Publications (Maastricht University) · doi:10.26481/spe.20221216mw
Multiple Subgoals-guided Hierarchical Learning in Robot Navigation
Luo, S., & Schomaker, L. (2022) · IEEE International Conference on Robotics and Biomimetics (ROBIO) · doi:10.1109/robio55434.2022.10011912
“Although Deep Reinforcement Learning [1] has achieved remarkable successes in many sequential decision making fields, such as playing games [2] [3], recommendation systems [4], human-robot interaction [5], manipulation [6] and locomotion [7].”
Background
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.