Improving Monte Carlo Tree Search with Artificial Neural Networks without Heuristics

1. Cotarelo, Alba
2. García-Díaz, Vicente
3. Núñez-Valdez, Edward Rolando
4. González García, Cristian
5. Gómez, Alberto
6. Chun-Wei Lin, Jerry

Exportar

Exportar

×

MLA

modern-language-association

APA

apa

Chicago

chicago-fullnote-bibliography

Harvard

harvard-cite-them-right

Vancouver

vancouver-author-date

---

RIS BibTex

Exportar

×

El documento no se puede exportar porque pertenece a otro portal.

Texto completo

lock_openTexto completo externo lock_openTexto completo externo

DOI: 10.3390/APP11052056 GOOGLE SCHOLAR lock_openAcceso abierto editor

Otras publicaciones en: Applied Sciences

Resumen

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 domain language at some point, making very difficult its application to other problems. We propose a general and optimized implementation of Monte Carlo Tree Search using neural networks without extra knowledge of the problem. As an example of our proposal, we made use of the Dots and Boxes game. We tested it against other Monte Carlo system which implements specific knowledge for this problem. Our approach improves accuracy, reaching a winning rate of 81% over previous research but the generalization penalizes performance.