COMPUTING “ELO RATINGS” OF MOVE PATTERNS IN THE GAME OF GO
Explore this paper's citation graph
Summary
A new Bayesian technique for supervised learning of move patterns from game records based on a generalization of Elo ratings, which outperforms most previous pattern-learning algorithms, both in terms of mean log-evidence and prediction rate.
- Type
- article
- Published
- 2007-12-01
- Cited by
- 363
- References
- 20
- Access
- Open access
- OpenAlex
- https://openalex.org/W1500868819
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:5733047
Keywords
Computer science
References
- Machine Learning, Game Play, and Go
- Bayesian Generation and Integration of K-nearest-neighbor Patterns for 19x19 Go
- Honte, a go-playing program using neural nets
- The rating of chessplayers, past and present
- The Golem Go Program
- HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO
- Progressive Strategies for Monte-Carlo Tree Search
- Move Prediction in Go with the Maximum Entropy Method
- Associating domain-dependent knowledge and Monte Carlo approaches within a Go program
- Bayesian pattern ranking for move prediction in the game of Go
- MM algorithms for generalized Bradley-Terry models
- Iterative Widening
- Modification of UCT with Patterns in Monte-Carlo Go
- Local Move Prediction in Go
- Modification of UCT with Patterns in Monte-Carlo Go
- TrueSkillTM: A Bayesian Skill Rating System
- Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Cited by
- CROSS-ENTROPY FOR MONTE-CARLO TREE SEARCH
- Solving Games and All That
- The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning
- Du jeu de Go au Havannah : variantes d'UCT et coups décisifs
- The Last-Good-Reply Policy for Monte-Carlo Go
- A Shogi Program Based on Monte-Carlo Tree Search
- Monte-Carlo tree search using expert knowledge: an application to computer go and human genetics
- Adding domain knowledge to a monte carlo tree search algorithm in the game of Go
- Monte Carlo Tree Search for Continuous and Stochastic Sequential Decision Making Problems. (Monte Carlo Tree Search pour les problèmes de décision séquentielle en milieu continus et stochastiques)
- Scalable Planning and Learning for Multiagent POMDPs
- Surrogate-Assisted Evolutionary Algorithms
- Monte-Carlo techniques : applications to the game of the Amazons
- A Supervised Learning Method for Chinese Chess Programs
- ARIMAA: developing a higher ranked fall back move generator using a relational database
- Bandit algorithms for searching large spaces
- On-the-Job Learning with Bayesian Decision Theory
- Introduction of statistics in optimization
- Apprentissage par Renforcement : Au delà des Processus Décisionnels de Markov (Vers la cognition incarnée)
- Selective search in games of different complexity
- Introduction de connaissances expertes en Bandit-Based Monte-Carlo Planning avec application au Computer-Go
Related papers
- DETERMINING QUALITY REQUIREMENTS AT THE UNIVERSITIES TO IMPROVE THE QUALITY OF EDUCATION
- Using DataGrid Control to Realize DataBase of Querying in VB6.0
- Study and Two Types of Typical Usage of DataGrid Web Server Control
- Bidirectional Sort and Choosing a Row to Update or Delete by Click Any Cell in DataGrid
- Flexible Application of VSFlexGrid
- GMQL: A graphical multimedia query language
- Query Caching Method for Distributed Web Caching