Polygames: Improved zero learning

Author:

Cazenave Tristan1,Chen Yen-Chi2,Chen Guan-Wei3,Chen Shi-Yu3,Chiu Xian-Dong3,Dehos Julien4,Elsa Maria3,Gong Qucheng5,Hu Hengyuan5,Khalidov Vasil5,Li Cheng-Ling3,Lin Hsin-I3,Lin Yu-Jin3,Martinet Xavier5,Mella Vegard5,Rapin Jeremy5,Roziere Baptiste5,Synnaeve Gabriel5,Teytaud Fabien4,Teytaud Olivier5,Ye Shi-Cheng3,Ye Yi-Jun3,Yen Shi-Jim3,Zagoruyko Sergey5

Affiliation:

1. LAMSADE, University Paris-Dauphine, PSL, France

2. National Taiwan Normal University, Taiwan

3. AILAB, Dong Hwa University, Taiwan

4. University Littoral Cote d’Opale, France

5. Facebook AI Research, France and United States

Abstract

Since DeepMind’s AlphaZero, Zero learning quickly became the state-of-the-art method for many board games. It can be improved using a fully convolutional structure (no fully connected layer). Using such an architecture plus global pooling, we can create bots independent of the board size. The training can be made more robust by keeping track of the best checkpoints during the training and by training against them. Using these features, we release Polygames, our framework for Zero learning, with its library of games and its checkpoints. We won against strong humans at the game of Hex in 19 × 19, including the human player with the best ELO rank on LittleGolem; we incidentally also won against another Zero implementation, which was weaker than humans: in a discussion on LittleGolem, Hex19 was said to be intractable for zero learning. We also won in Havannah with size 8: win against the strongest player, namely Eobllor, with excellent opening moves. We also won several first places at the TAAI 2019 competitions and had positive results against strong bots in various games.

Publisher

IOS Press

Subject

Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Computational Mechanics,Computer Science (miscellaneous)

Reference11 articles.

1. The frontier of decidability in partially observable recursive games;Auger;International Journal of Foundations of Computer Science,2012

2. On the complexity of connection games;Bonnet;Theor. Comput. Sci.,2016

3. Buffet, O., Lee, C.-S., Lin, W. & Teytaud, O. (2012). Optimistic heuristics for MineSweeper. In International Computer Symposium, Hualien, Taiwan. https://hal.inria.fr/hal-00750577.

4. Coulom, R. (2007). Efficient selectivity and backup operators in Monte-Carlo tree search. In Proceedings of the 5th International Conference on Computers and Games. CG’06 (pp. 72–83). Berlin, Heidelberg: Springer.

5. Bandit Based Monte-Carlo Planning

Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3