Polygames: Improved Zero Learning

T. Cazenave, Yen-Chi Chen, Guanting Chen, Shi-Yu Chen, Xian-Dong Chiu, J. Dehos, Maria Elsa, Qucheng Gong, Hengyuan Hu, Vasil Khalidov, Cheng-Ling Li, Hsin-I Lin, Yu-Jin Lin, Xavier Martinet, Vegard Mella, J. Rapin, Baptiste Rozière, Gabriel Synnaeve, F. Teytaud, O. Teytaud, Shi-Cheng Ye, Yi-Jun Ye, Shi-Jim Yen, Sergey Zagoruyko
{"title":"Polygames: Improved Zero Learning","authors":"T. Cazenave, Yen-Chi Chen, Guanting Chen, Shi-Yu Chen, Xian-Dong Chiu, J. Dehos, Maria Elsa, Qucheng Gong, Hengyuan Hu, Vasil Khalidov, Cheng-Ling Li, Hsin-I Lin, Yu-Jin Lin, Xavier Martinet, Vegard Mella, J. Rapin, Baptiste Rozière, Gabriel Synnaeve, F. Teytaud, O. Teytaud, Shi-Cheng Ye, Yi-Jun Ye, Shi-Jim Yen, Sergey Zagoruyko","doi":"10.3233/ICG-200157","DOIUrl":null,"url":null,"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.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"111 3S 1","pages":"244-256"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Int. Comput. Games Assoc.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/ICG-200157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29

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.
Polygames:改进零学习
自从DeepMind的AlphaZero之后,Zero学习迅速成为许多棋类游戏的最先进方法。它可以使用全卷积结构(没有完全连接层)来改进。使用这样的架构加上全局池,我们可以创建独立于板大小的bot。通过在训练期间跟踪最佳检查点并针对它们进行训练,可以使训练更加健壮。利用这些功能,我们发布了Polygames,这是我们的零学习框架,带有游戏库和检查点。我们在19 × 19的Hex比赛中战胜了强大的人类选手,包括little legolem上ELO排名最高的人类选手;顺便说一句,我们也战胜了另一个Zero实现,它比人类弱:在littlelegolem的讨论中,Hex19被认为是难以实现零学习的。我们在哈瓦那也以8号赢得了比赛:凭借出色的开局,我们战胜了最强的选手Eobllor。我们还在2019年的TAAI比赛中获得了几次第一名,并在各种比赛中对阵强大的机器人取得了积极的成绩。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信