{"title":"Editorial: Ludii, Konane and the Computer Olympiads","authors":"T. Cazenave","doi":"10.3233/icg-220196","DOIUrl":null,"url":null,"abstract":"The first scientific contribution to this issue is Deep Learning for General Game Playing with Ludii and Polygames by Dennis J.N.J. Soemers, Vegard Mella, Cameron Browne and Olivier Teytaud. Polygames is a general Deep Reinforcement Learning engine that combines Monte Carlo Tree Search and Deep Neural Networks trained through self-play. Ludii is a general game system that now con-tains more than one thousand games. The paper describes the bridge between Ludii and Polygames that enables Polygames to train and evaluate games that are implemented and run through Ludii. Polygames can represent any game implemented in Ludii. The authors also give experimental results for multiple board games and discuss future research. The second scientific contribution is Solving Narrow Konane Boards by Jos W.H.M. Uiterwijk. Konane is a partizan combinatorial game involving captures. The independent subgames can be associ-ated to numbers and nimbers that can be summed to get the value of the whole game combining the subgames. The paper explains two notions that proved very useful to solve Konane boards. The safe moves of a player are the moves that cannot be prevented by the opponent. The independence of two fragments relies on the impossibility of their interaction. Using these notions some results on solving 1 × n , 2 × n , 3 × n and 4 × n boards are found. In this issue we also have a report by Jonathan Schaeffer on the Computer Olympiads from 1989 up to now.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"49 1","pages":"145"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Int. Comput. Games Assoc.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/icg-220196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The first scientific contribution to this issue is Deep Learning for General Game Playing with Ludii and Polygames by Dennis J.N.J. Soemers, Vegard Mella, Cameron Browne and Olivier Teytaud. Polygames is a general Deep Reinforcement Learning engine that combines Monte Carlo Tree Search and Deep Neural Networks trained through self-play. Ludii is a general game system that now con-tains more than one thousand games. The paper describes the bridge between Ludii and Polygames that enables Polygames to train and evaluate games that are implemented and run through Ludii. Polygames can represent any game implemented in Ludii. The authors also give experimental results for multiple board games and discuss future research. The second scientific contribution is Solving Narrow Konane Boards by Jos W.H.M. Uiterwijk. Konane is a partizan combinatorial game involving captures. The independent subgames can be associ-ated to numbers and nimbers that can be summed to get the value of the whole game combining the subgames. The paper explains two notions that proved very useful to solve Konane boards. The safe moves of a player are the moves that cannot be prevented by the opponent. The independence of two fragments relies on the impossibility of their interaction. Using these notions some results on solving 1 × n , 2 × n , 3 × n and 4 × n boards are found. In this issue we also have a report by Jonathan Schaeffer on the Computer Olympiads from 1989 up to now.
对此问题的第一个科学贡献是Dennis J.N.J. Soemers、Vegard Mella、Cameron Browne和Olivier Teytaud所著的《Deep Learning for General Game Playing with Ludii and Polygames》。Polygames是一个通用的深度强化学习引擎,它结合了蒙特卡洛树搜索和通过自我游戏训练的深度神经网络。Ludii是一个通用的游戏系统,现在包含一千多个游戏。本文描述了Ludii和Polygames之间的桥梁,使Polygames能够训练和评估通过Ludii实现和运行的游戏。Polygames可以表示在Ludii中实现的任何游戏。作者还给出了多种棋盘游戏的实验结果,并对未来的研究进行了讨论。第二个科学贡献是Jos W.H.M. Uiterwijk的《解决狭窄的Konane板》。Konane是一个包含捕获的游击组合游戏。独立的子游戏可以与数字和数字相关联,这些数字可以被求和,从而得到结合子游戏的整个游戏的价值。本文解释了两个被证明对解Konane板非常有用的概念。棋手的安全步是指对手无法阻止的步。两个片段的独立性依赖于它们相互作用的不可能性。利用这些概念,得到了求解1 × n、2 × n、3 × n和4 × n板的一些结果。在这一期中,我们也有Jonathan Schaeffer关于1989年至今的计算机奥林匹克竞赛的报告。