Improving Model and Search for Computer Go
Author:
- 17 August 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Abstract
The standard for Deep Reinforcement Learning in games, following Alpha Zero, is to use residual networks and to increase the depth of the network to get better results. We propose to improve mobile networks as an alternative to residual networks and experimentally show the playing strength of the networks according to both their width and their depth. We also propose a generalization of the PUCT search algorithm that improves on PUCT.Keywords
All Related Versions
Funding Information
- GENCI (2020-AD011012119)
- Agence Nationale de la Recherche (ANR19-P3IA-0001)
This publication has 8 references indexed in Scilit:
- Polygames: Improved zero learningICGA Journal: The Journal of the Computer Games Community, 2021
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-playScience, 2018
- MobileNetV2: Inverted Residuals and Linear Bottlenecks2018
- Squeeze-and-Excitation Networks2018
- Mastering the game of Go without human knowledgeNature, 2017
- Residual Networks for Computer GoIEEE Transactions on Games, 2017
- Mastering the game of Go with deep neural networks and tree searchNature, 2016
- Bandit Based Monte-Carlo Planning2006