A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play

@article{Silver2018AGR,
  title={A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play},
  author={David Silver and Thomas Hubert and Julian Schrittwieser and Ioannis Antonoglou and Matthew Lai and Arthur Guez and Marc Lanctot and L. Sifre and Dharshan Kumaran and Thore Graepel and Timothy P. Lillicrap and Karen Simonyan and Demis Hassabis},
  journal={Science},
  year={2018},
  volume={362},
  pages={1140 - 1144}
}
The game of chess is the longest-studied domain in the history of artificial intelligence. [...] Key Result Starting from random play and given no domain knowledge except the game rules, AlphaZero convincingly defeated a world champion program in the games of chess and shogi (Japanese chess), as well as Go.Expand
Mastering board games
TLDR
Silver et al. (6) show that a generalization of this approach is effective across a variety of games, and their Alpha-Zero system learned to play three challenging games at the highest levels of play seen. Expand
Learning to Play: Reinforcement Learning and Games
  • A. Plaat
  • Computer Science, Psychology
  • 2020
TLDR
It is shown that the methods generalize to three games, hinting at artificial general intelligence, and an argument can be made that in doing so the authors failed the Turing test, since no human can play at this level. Expand
Learning to Play the Chess Variant Crazyhouse Above World Champion Level With Deep Neural Networks and Human Data
TLDR
Improvements include modifications in the neural network design and training configuration, the introduction of a data normalization step and a more sample efficient Monte-Carlo tree search which has a lower chance to blunder. Expand
A Survey of Planning and Learning in Games
TLDR
This paper presents a survey of the multiple methodologies proposed to integrate planning and learning in the context of games, both in terms of their theoretical foundations and applications and also presents learning and planning techniques commonly used in games. Expand
Learning self-play agents for combinatorial optimization problems
TLDR
This paper explores neural Monte Carlo Tree Search (neural MCTS), an RL algorithm that has been applied successfully by DeepMind to play Go and Chess at a superhuman level, and proposes the Zermelo Gamification to transform specific combinatorial optimization problems into Zermello games whose winning strategies correspond to the solutions of the original optimization problems. Expand
Learning Self-Game-Play Agents for Combinatorial Optimization Problems
TLDR
The Zermelo Gamification (ZG) is proposed, following the idea of Hintikka's Game-Theoretical Semantics, to transform specific combinatorial optimization problems intoZermelo games whose winning strategies correspond to the solutions of the original optimization problem. Expand
Development of a Computer Player for Seejeh (A.K.A Seega, Siga, Kharbga) Board Game with Deep Reinforcement Learning
TLDR
This work develops an automated player based solely on reinforcement learning, without human data, guidance or domain knowledge beyond game rules, and is the first who develop an agent that learns to play Seejeh game. Expand
A Game-centric Approach to Teaching Artificial Intelligence
TLDR
A game-centric approach to teaching artificial intelligence that follows the historical development of algorithms by popping the hood of these champion bots is reflected, and a server infrastructure for playing card games in perfect information and imperfect information playing mode is made available. Expand
Assessing Game Balance with AlphaZero: Exploring Alternative Rule Sets in Chess
TLDR
An analytic comparison show that pieces are valued differently between variants, and that some variants are more decisive than classical chess, demonstrate the rich possibilities that lie beyond the rules of modern chess. Expand
Towards Understanding Chinese Checkers with Heuristics, Monte Carlo Tree Search, and Deep Reinforcement Learning
TLDR
This work presents an approach that effectively combines the use of heuristics, Monte Carlo tree search, and deep reinforcement learning for building a Chinese Checkers agent without theUse of any human game-play data. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 51 REFERENCES
Mastering the game of Go without human knowledge
TLDR
An algorithm based solely on reinforcement learning is introduced, without human data, guidance or domain knowledge beyond game rules, that achieves superhuman performance, winning 100–0 against the previously published, champion-defeating AlphaGo. Expand
Mastering the game of Go with deep neural networks and tree search
TLDR
Using this search algorithm, the program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0.5, the first time that a computer program has defeated a human professional player in the full-sized game of Go. Expand
A STRATEGIC METAGAME PLAYER FOR GENERAL CHESS‐LIKE GAMES
  • B. Pell
  • Computer Science
  • Comput. Intell.
  • 1996
TLDR
Besides being the first Metagame‐playing program, this is the first program to have derived useful piece values directly from analysis of the rules of different games. Expand
Learning to Play Chess Using Temporal Differences
TLDR
TDLEAF(λ), a variation on the TD(λ) algorithm that enables it to be used in conjunction with game-tree search, is presented and it is investigated whether it can yield better results in the domain of backgammon, where TD( ε) has previously yielded striking success. Expand
Computer shogi
TLDR
The current state of the art in computer shogi is described, and it is conjecture that by the year 2010 a computer will be comparable in strength to the best human players. Expand
Programming backgammon using self-teaching neural nets
TLDR
This paper views machine learning as a tool in a programmer's toolkit, and considers how it can be combined with other programming techniques to achieve and surpass world-class backgammon play. Expand
Giraffe: Using Deep Reinforcement Learning to Play Chess
TLDR
Giraffe is the most successful attempt thus far at using end-to-end machine learning to play chess, with minimal hand-crafted knowledge given by the programmer. Expand
Bootstrapping from Game Tree Search
TLDR
This paper introduces a new algorithm for updating the parameters of a heuristic evaluation function, by updating the heuristic towards the values computed by an alpha-beta search, and implemented this algorithm in a chess program Meep, using a linear heuristic function. Expand
TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play
TLDR
The latest version of TD-Gammon is now estimated to play at a strong master level that is extremely close to the world's best human players. Expand
Temporal difference learning applied to game playing and the results of application to Shogi
TLDR
This paper describes the application of temporal difference (TD) learning to minimax searches in general, and presents results from shogi, finding values that performed well in matches against hand-crafted values. Expand
...
1
2
3
4
5
...