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 3,201–3,300 of 3,633
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., & He, Z. (2024) · International Congress on Image and Signal Processing (CISP) · 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 · Cited by 1
“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., Kleiman-Weiner, M., 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
Analysis of Train Movement Strategies for Time Delays Using the Nash Equilibrium
Dorofeeva, Y., Bychkov, M., Karvanen, M., et al. (2025) · Intellectual Technologies on Transport · doi:10.20295/2413-2527-2025-141-20-26
Core structure-guided multi-modal classification via Monte Carlo Tree Search
Liu, G., Qian, Y., Liang, X., & Fu, P. (2025) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-025-02606-z
“As a result, it is used for the prediction of protein complex structure (AlphaFold) [23], the search for neural architecture [24], chemical synthesis [25] and games [26], becoming an important method for handling cross-domain tasks in open AI.”
Solving 7x7 Killall-Go with Seki Database
Tsai, Y. T., Wei, T.-H., Lin, C. Y., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-86585-5_6
Analysing KataGo: A Comparative Evaluation Against Perfect Play in the Game of Go
Husna, A., & Müller, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-86585-5_4 · Cited by 1
“DeepMind’s AlphaZero (AZ) program [12] has greatly advanced the state of the art in playing two player board games.”
Reinforcement Learning for Industrial Control: From Toolkit Development to Practical Applications
Duan, J., Wang, W., Lyu, Y., Zhang, X., Song, X., Xiao, L., & Li, S. E. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-14081-5.00026-x
Design and Implementation of Anti-electric Shock Warning System Based on Computer Algorithms
Cui, Y., Li, Y., Zhang, K., et al. (2024) · doi:10.1145/3718491.3718522
ArenaSim: A High-Performance Simulation Platform for Multi-Robot Self-Play Learning
Ke, Y., Li, S., Li, Z., Li, H., Liu, Y., & He, Y. (2025) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2025.3557224 · Cited by 1
“S ELF-PLAY (SP) has recently achieved significant advancements in extensive games, such as board games [1], [2], [3], poker [4], [5], and real-time strategy (RTS) games [6], [7].”
Monte Carlo Tree Search for Binary Inverse Problems with $O(1)$ Measurements
Khirwadkar, P., Kar, O. F., & Pal, P. (2024) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/ieeeconf60004.2024.10943017
“In recent times, a tree-based search framework called Monte Carlo Tree Search (MCTS) [15]–[17] has gained significant popularity due to its effectiveness in playing combinatorial games such as Go [18], [19] and Chess [20].”
KI in der Wirbelsäulenchirurgie: Die Macht der Vorhersage
Hegewald, A. A. (2025) · Die Wirbelsäule · doi:10.1055/a-2279-4590
Sensor Placement Algorithms and Learning Methods for Gravitational Wave Interferometers
Muldoon, C. (2025) · Springer Series in Astrophysics and Cosmology · doi:10.1007/978-981-96-1737-1_9
Combining Tree Search With Value Prediction Models Capable of Estimating Their Uncertainty
Świechowski, M. (2025) · IEEE Transactions on Games · doi:10.1109/tg.2025.3561016
“Longer term goals aim to surpass top human players [1] or even solve the game completely [2].”
A Study on Reinforcement Learning in Tri-Othello
Ho, Y., & Chen, C. (2024) · International Computer Symposium · doi:10.1109/ics64339.2024.00013
“Sub-sequently, it was evolved into AlphaZero, a generalized version applicable to various board games [6].”
Broda, S. A., Nard, G. D., & Walker, P. S. (2026) · Journal of risk and financial management · doi:10.2139/ssrn.5185432
Artificial Intelligence and the Future of Employment: A Balanced Assessment of Workforce ChangesPreprint
Sarikaya, F. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5100625 · Cited by 3
Practical Reinforcement Learning Using Time-Efficient Model-Based Policy Optimization
Huang, W., Cui, Y., Peng, L., & Wu, X. (2025) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2025.3561771
“3) Evaluated the e ff ectiveness and practicality of the proposed method using five Mujoco benchmarks and one quadruped robot control scenario.”
Computational Neuropharmacology in Psychiatry
Gholap, A. D., Khuspe, P. R., Bharati, D. K., Pardeshi, S. R., Ahmad, M. D., Hossain, A. B. M. S., Prajapati, B. G., & Faiyazuddin, M. (2025) · Wiley eBooks · doi:10.1002/9781394242474.ch7 · Cited by 11
Injecting Combinatorial Optimization into MCTS: Application to the Board Game Boop
Richoux, F. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-90065-5_32
The Nature of Algorithms and Their Relation to Accountability
Verdicchio, M. (2025) · Philosophy of engineering and technology · doi:10.1007/978-3-031-87974-6_7
Adaptive multi-player poker policy learning based on opponent style modeling
Shi, D., Guo, X., Liu, Y., & Fan, W. (2025) · Neural Computing and Applications · doi:10.1007/s00521-025-11262-x
“Future research should explore synergies between policy iteration methods and multi-player poker algorithms, leveraging insights from broader control and optimization domains to address the intricacies of multi-agent interactions [49].”
Kondepudy, K., Saini, M., Jaiswal, G., & Singh, J. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-96-3381-4_39
Wang, Y., KAI, P., Chen, H., Zhao, K., Guirao, J. L. G., & Cao, D. (2025) · Fractals · doi:10.1142/s0218348x25401863
Playing RollerCoaster Tycoon with Reinforcement Learning
Campbell, J., & Verbrugge, C. (2025) · International Conference on the Foundations of Digital Games (FDG) · doi:10.1145/3723498.3723818
Supplemental techniques for registering interocclusal records for complete dentures
Wee, A. G., Prasad, S., & Nirkhiwale, A. (2025) · Journal of Dental Health Oral Disorders and Therapy · doi:10.15406/jdhodt.2025.16.00641
Xiao, J., Qiu, C., Xu, Y., et al. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5260381
Monte-Carlo tree search is work in progress
Pepels, T. H. J. (2025) · Research Publications (Maastricht University) · doi:10.26481/dis.20250604tp
Competitive Learning in Embodied Multi-agent System
Liu, H., Liu, X., Huang, K., & Guo, D. (2025) · Machine learning · doi:10.1007/978-981-96-5871-8_5
Reinforcement Learning in Practice: Muti-applications of Basic Theory
Su, H. (2025) · Applied and Computational Engineering · doi:10.54254/2755-2721/2025.tj23293
“For example, systems such as AlphaGo [13], OpenAI Five [14, 15], AlphaStar [16], DeepStack, and Suphx have reached or exceeded the level of human experts in these areas.”
The Game Boy Learning Environment
Fazzari, E., Romano, D., Falchi, F., & Stefanini, C. (2025) · IEEE Transactions on Games · doi:10.1109/tg.2025.3575527 · Cited by 2
“In 2016, strategic games, such as Shogi , chess, and Go regained prominence with the emergence of AlphaGo [17], subsequently evolving into AlphaZero [42] and MuZero [43].”
Predicting Ecosystem Resilience Using Multi-Agent Reinforcement LearningPreprint
Strannegård, C., Palak, M., Engsner, N., Stocco, A., Antonelli, A., & Silvestro, D. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.06.07.658424
“It has also been used for developing programs that can play video games like Pac-Man and Space Invaders [24], strategic games like chess and Go [25], and most recently, Minecraft [26].”
Extending Heuristic Knowledge Transfer for General Game Playing
Jung, J. D. A., & Hoey, J. (2025) · IEEE Transactions on Games · doi:10.1109/tg.2025.3578435
“Recent deep learning projects, like AlphaZero [2], have bucked this trend by achieving world-class performance across a variety of games.”
Li, W., & Zhang, H. (2025) · Algorithms · doi:10.3390/a18060363 · Cited by 1
Girish Kumar, D., Kumar, K. S. S., Prasad, P. P. R., Jalade, S. C., Kumar, C. T. M. P., & Subhashree, D. C. (2025) · International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE) · doi:10.1109/icdcece65353.2025.11035271
“Previous studies [8],[9],[13],[14] have shown that deep reinforcement learning-based bots like AlphaZero demand extensive hardware resources, limiting their accessibility.”
A Digital Twin Radar Environment for Testing and Evaluation of AI Applications
Gogineni, S., Guerci, J. R., Schutz, R. W., McGee, G. I., Watson, B. C., Nguyen, H. K., Carlos, J. D., & Stevens, D. L. (2025) · IEEE International Radar Conference · doi:10.1109/radar52380.2025.11031773
“…we illustrate a method where the ‘target detection/location system under test’ is evaluated against RD inputs that obey valid statistics but were unanticipated (unknown - unknown) much as completely valid chess moves but unknown after years of study were revealed by Google’s AlphaZero [15].”
Adversarial Search and Deep Learning for Strategic Settlement Placement in the “Settlers of Catan”
Papadam, D. R., & Chalkiadakis, G. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-93930-3_4
Exploring and Validating Key Components Enabling Context-Based Dynamism in Chatbot Architectures
Gulatl, K., Unhelkar, B., Y, M. R. P., Kumar, S. K., Chavan, V., & Pallathadka, H. (2025) · International Conference on Frontier Technologies and Solutions (ICFTS) · doi:10.1109/icfts62006.2025.11031879
“The primary goal of Unit Tests is to verify the precision of specific components, including the Natural Language Understanding (NLU) system and the context update mechanism [13]-[15].”
Retracted: AI-Assisted Theorem Discovery: Revolutionizing Mathematical Exploration
Nursanti, Y. B., Sujadi, İ., Kurniawati, I., Wulandari, A. N., & Andriatna, R. (2025) · International Conference on Frontier Technologies and Solutions (ICFTS) · doi:10.1109/icfts62006.2025.11031488
RetractedOn the Mistaken Assumption of Interchangeable Deep Reinforcement Learning Implementations
Hundal, R. S., Xiao, Y., Cao, X., Dong, J. S., & Rigger, M. (2025) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse55347.2025.00222 · Cited by 1
“DRL has proven to be extremely effective in games with recent advances in the field; for example, DeepMind’s AlphaZero [5] became the first algorithm to beat a world-champion computer program at Chess, Shogi, and Go and OpenAI’s OpenAI Five [6] became the first algorithm to defeat the human world…”
Kaas, M. H. L. (2025) · Wiley eBooks · doi:10.1002/9781394238651.ch18
Designing biochemical circuits with tree searchPreprint
Bhamidipati, P. S., & Thomson, M. W. (2025) · eLife · doi:10.7554/elife.106497
Designing biochemical circuits with tree searchPreprint
Bhamidipati, P. S., & Thomson, M. W. (2025) · eLife · doi:10.7554/elife.106497.1 · Cited by 1
Learning to Explore Tree Neighbourhoods for Phylogenetic InferencePreprint
Verdù, F. J. C., Gasparin, A., Bortolussi, L., et al. (2025) · Research Square · doi:10.21203/rs.3.rs-6809300/v1
Uhl, R. T., Schüle, I., Ludmann, L., et al. (2025) · SAE technical papers on CD-ROM/SAE technical paper series · doi:10.4271/2025-01-0291
The Fundamental Theorem for Eco-Environmental Surface Modelling
Yu, G., Zhao, N., Shi, W., & Fan, Z. (2025) · Springer eBooks · doi:10.1007/978-981-96-1977-1_2
Chen, T.-J., Hong, Y.-J., Chung, S.-C., & Wang, C. M. (2025) · Applied Sciences · doi:10.3390/app15137490
An NLP Interface for Social AI Agents in The Resistance: Avalon
West, H., & Fendt, M. W. (2025) · doi:10.26503/dl.v2025i2.2423
Efficient Offline Reinforcement Learning via Planning in Latent Space
Guo, Y., & Liu, Q. (2025) · Communications in computer and information science · doi:10.1007/978-981-96-6951-6_13
Design and Development of AI Powered Chess Engine
Bhalekar, A. (2025) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2025.73063
Jadav, D., & Mandanaka, T. (2025) · INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT · doi:10.55041/ijsrem51328
Explainability for Unmanned Aerial Vehicle Control via Multi-Objective Reinforcement Learning
Clark, C. A., Albarado, K. M., Wilson, J. P., Bernard, C. A., Scott, J. D., & d'Aliberti, L. (2025) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero63441.2025.11068676
Weng, J. (2025) · Proceedings of the 2025 International Conference on Artificial Intelligence and Computational Intelligence · doi:10.1145/3730436.3745779
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.002.0005
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.002.0007
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0007
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0001
Taxonomies of Cognitive Architectures
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0004
Practical Applications of Cognitive Architectures
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0010
Cognitive Architectures, AI, and Cognitive Science
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0003
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.002.0004
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0008
Challenges of the Past and Opportunities Ahead
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0013
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0006
Cognitive Architectures in the Deep Learning Era
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0012
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0009
What Are Cognitive Architectures?
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0002
Evaluating Cognitive Architectures
Kotseruba, I., & Tsotsos, J. K. (2025) · Oxford University Press eBooks · doi:10.1093/oso/9780192844835.003.0011
A Novel BS-UCT Algorithm With Deep Reinforcement Learning for the Game EWN
Xu, W., Li, Z., Cao, Y., Shi, X., & Cao, J. (2025) · IEEE Transactions on Games · doi:10.1109/tg.2025.3592768
“AlphaZero [10] inspired Takada et al. [27] to develop a RL algorithm for Hex, which constructs value and strategy functions through self-play, bypassing the need for probabilistic searches.”
Image Transformation Sequence Retrieval with General Reinforcement Learning
Mas-Candela, E., Ríos-Vila, A., & Calvo-Zaragoza, J. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-99565-1_26
An AI-Driven Approach to the Guessing Game: Leveraging Llama-3.1
Palaniappan, M. M., Venkataraman, S., Sundharakumar, K. B., & Natarajan, S. (2025) · Algorithms for intelligent systems · doi:10.1007/978-981-96-5210-5_25
Test-Fleet Scheduling in Complex Validation and Production Environments
Datta, A., Yaganti, B. V., Palocska, M., et al. (2025) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/3749985
“DRL is now widely used for applications such as autonomous vehicles[21], unmanned aerial vehicles [18], board games [28], and as fine tuners of Large Language Models [36].”
LSAFJiu: A Low-Resource Algorithm for Tibetan Jiu Chess Based on Long Sequence Action Forecasting
Li, X., Chen, S., Yu, J., Fan, X., & Dai, J. (2025) · Tsinghua Science & Technology · doi:10.26599/tst.2025.9010117
Novelty in Monte Carlo Tree Search
Baier, H., & Kaisers, M. (2025) · IEEE Transactions on Games · doi:10.1109/tg.2025.3589115 · Cited by 1
“…more recent literature on the topic (see Section III-A4), an analysisofthetimeoverheadofourapproach(seeSectionIV-D), andweareshowingtheeffectivenessofourapproachnotonly forMCTSguidedbyhandcodedheuristics,butadditionally forMCTSguidedbylearnedheuristics,i.e.,neuralnetworks inthestyleofAlphaZero[5].”
InfluentialXu, D. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5386568 · Cited by 3
Neural Motion Simulator Pushing the Limit of World Models in Reinforcement Learning
Hao, C., Lu, W., Xu, Y., & Chen, Y. (2025) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52734.2025.02571 · Cited by 18
“Planning Capability : Many real-world tasks demand long-term planning, where models predict outcomes over action sequences and search for optimal ones [35, 37, 40].”
Predicting Performance in Strategic Games based on Player Habits using AI
Abhijith, U., & Kumar, D. (2025) · doi:10.1109/netcrypt65877.2025.11102517
“[6] Mixed Models Player adaptation to AI Unstructured ML setup King (2023) [7] General ML Sports analytics crossover Broad, non-specific to chess Zhou & Tang (2023) [8] Bayesian Nets Probabilistic performance modelling No psychological inputs IBM (2023) [9] Proprietary ML Real-time prediction tools Non-transparent Ope…”
InfluentialReinforcement Learning in Robotic Systems: A Review on Sim-to-Real TransferPreprint
Khapre, S. P., Tiwari, R., & Singh, A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5387665
Eine Künstliche Intelligenz als Entdeckerin
Domainko, W. (2025) · Springer eBooks · doi:10.1007/978-3-662-71577-2_2
A Call for Deeper Collaboration Between Robotics and Game Development
Leite, I., Ahlberg, W., Pereira, A., Sestini, A., Gisslén, L., & Tollmar, K. (2025) · IEEE Conference on Games (CoG) · doi:10.1109/cog64752.2025.11114209 · Cited by 2
A K-Means Algorithm for Digital Inclusion and Household Finance Forecasts
Peng, C. (2025) · Smart innovation, systems and technologies · doi:10.1007/978-981-96-7269-1_29
Structure-Exploiting Reinforcement Learning for Networked Systems
Qu, G. (2025) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc63710.2025.11107771 · Cited by 1
How explainable artificial intelligence can help humans innovate
Agostinelli, F. (2021) · doi:10.64628/aai.tk4p6ku37
Briegel, H. J., & Müller, T. (2025) · Synthese Library/Synthese library · doi:10.1007/978-3-031-98119-7_2
Ewers, J., Gibbs, J., & Anderson, D. (2025) · International Conference on Information Fusion (FUSION) · doi:10.23919/fusion65864.2025.11123969
“RL has been shown to learn novel approaches and outperform state-of-the-art algorithms in applications including wilderness search and rescue [6], drone racing [7] and abstract strategy games including chess and Go [8].”
Can LLMs Play Ô Ăn Quan? A Study of Multi-Step Planning and Decision Making
Nguyen, S. Q., Nguyen, K. V., Nguyen, V.-T., et al. (2025) · International Conference on Multimedia Analysis and Pattern Recognition (MAPR) · doi:10.1109/mapr67746.2025.11133971
“In particular, recent studies have used board games such as Chess [16] and Go [17] as benchmarks to evaluate the performance of AI systems in complex and dynamic environments that require planning and long-term strategy.”
Mechanisms Utilised by Experts and Artificial Intelligence in Rectifying Cognitive Deviations
Chen, X., & Jiang, J. (2025) · International Journal of Human-Computer Interaction · doi:10.1080/10447318.2025.2549072
“As AI lacks the capacity for such nuanced assertions, its reliability in training Go players is questionable (Silver et al., 2018).”
GNN-RL: A Graph Neural Network-Based Reinforcement Learning Algorithm for 3D Path Planning of AUVs
Sun, Z., Cao, N., Shao, X., et al. (2025) · doi:10.1109/mrai65197.2025.11135627
Fan, Z., Lei, N., & Zhang, H. (2025) · IEEE International Conference on Image Processing and Computer Applications (ICIPCA) · doi:10.1109/icipca65645.2025.11138820
The Explainability of Machine Learning Algorithms for Victory Prediction in the Video Game Dota 2
Losada-Rodríguez, J., Castillo, P. Á., Mora, A. M., & García‐Sánchez, P. (2025) · doi:10.3390/cmsf2025011026 · Cited by 2
“RL algorithms, such as Deep Q-Learning and Actor–Critic models, have enabled agents to learn optimal behaviours in complex games, which can then be applied to predict human performance or improve game design [10–12].”
Khodadadi, Z., Trpevski, D., Lindroos, R., & Kotaleski, J. H. (2025) · eLife · doi:10.7554/elife.97274.3
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.