Improving Monte Carlo Tree Search with Artificial Neural Networks without Heuristics
Monte Carlo Tree Search is one of the main search methods studied presently. It has demonstrated its efficiency in the resolution of many games such as Go or Settlers of Catan and other different problems. There are several optimizations of Monte Carlo, but most of them need heuristics or some domai...
Main Authors: | Alba Cotarelo, Vicente García-Díaz, Edward Rolando Núñez-Valdez, Cristian González García, Alberto Gómez, Jerry Chun-Wei Lin |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-02-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/11/5/2056 |
Similar Items
-
BI-DIRECTIONAL MONTE CARLO TREE SEARCH
by: Kristian Spoerer
Published: (2021-06-01) -
An improved relief feature selection algorithm based on Monte-Carlo tree search
by: Jianyang Zheng, et al.
Published: (2019-01-01) -
Decoupled Monte Carlo Tree Search for Cooperative Multi-Agent Planning
by: Okan Asik, et al.
Published: (2023-02-01) -
Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
by: Michał Bereta
Published: (2017-12-01) -
Tensor Implementation of Monte-Carlo Tree Search for Model-Based Reinforcement Learning
by: Marek Baláž, et al.
Published: (2023-01-01)