{"title":"Editorial: Scrabble, Lamplighter and the Computer Olympiad","authors":"T. Cazenave","doi":"10.3233/icg-220200","DOIUrl":"https://doi.org/10.3233/icg-220200","url":null,"abstract":"The first scientific contribution to this issue is Heuri: A Scrabble Playing Engine Using a Probability-Based Heuristic by Alejandro González Romero, René Alquézar Mancho, Arturo Ramírez Flores, Francisco González Acuña and Ian García Olmedo. The authors propose a novel Scrabble move gen-erator based on anagrams as well as a novel Computer Scrabble engine called Heuri. It uses heuristic evaluation functions based on probabilities. On the contrary of other popular Scrabble engines it does not use simulations. Heuri is quite good at fishing (e.g. increasing the probability of a bingo at next move). It has beaten Spanish World Champions Scrabble players and it is particularly good in Spanish even if it can also play in English and in French. The authors think it could be further improved using search, opponent modeling and refined heuristics. The second scientific contribution is The Algebraic Solvability of the Novel Lamplighter Puzzle by Connor Gregor, Daniel Ashlock and Allan Willms. A new puzzle is defined as the lamplighter puzzle. It can be seen as rotating the hand of a watch with restrictions on the possible rotations, as well as lighting the cell associated to the position of the hand. The goal is to reach a given state with a se-quence of moves. The lamplighter puzzle is defined more generally in the paper and its solvability is analyzed. Multiple theorems, lemmas and remarks are provided related to the solvability of the standard puzzle. Following this in depth analysis a polynomial algorithm is given for standard instances. However non standard instances may still require a heuristic search. In the conclusions the author propose many variations and future work. Hiroyuki Iida, Jonathan Schaeffer and I-Chen Wu report on the 2021 Computer Olympiad and ques-tion about whether future Olympiads should be online or in-person. The latest SSDF rating list is also given at the end of this issue.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"33 1","pages":"189"},"PeriodicalIF":0.0,"publicationDate":"2022-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85470552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Solving narrow Konane boards","authors":"J. Uiterwijk","doi":"10.3233/icg-220198","DOIUrl":"https://doi.org/10.3233/icg-220198","url":null,"abstract":"In this paper we investigate the game of Konane, using Combinatorial Game Theory and game-specific solving strategies. We focus on narrow rectangular boards ( m × n boards with m ⩽ 4). These are dubbed as Linear Konane, Double Konane, Triple Konane, and Quadruple Konane, respectively. The initial board contains black and white stones in a checkered pattern, with a gap of two adjacent empty squares to enable moving. Only capture moves are possible. Depending on the exact location of the initial gap (the setup) we have four classes of initial Konane boards (two for Linear Konane), namely all combinations of a horizontal or vertical setup in the middle of the board or at a corner. For solving narrow Konane boards two notions proved very useful. First, we define moves that cannot be prevented by the opponent as safe moves of a player. Second, two fragments are independent if there is no way they can ever interact. Using these two notions Linear and Double Konane have been completely solved. Triple Konane was solved except for the horizontal corner setup. For Quadruple Konane only the vertical setup in the middle of the board was solved.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"122 1","pages":"162-183"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80411199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Computer Olympiads 1989-2021","authors":"J. Schaeffer","doi":"10.3233/icg-220199","DOIUrl":"https://doi.org/10.3233/icg-220199","url":null,"abstract":"The Computer Olympiads have been held 24 times over the past 33 years. This series of events is an important landmark that demonstrates the progress of artificial intelligence technology applied to games. This article presents comparative data on the Olympiads. Some entries contain partial information, while a few have conflicting answers. The author asks the ICGA community for help in ensuring that the data is complete and correct.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"27 1","pages":"184-187"},"PeriodicalIF":0.0,"publicationDate":"2022-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86524805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Editorial: Ludii, Konane and the Computer Olympiads","authors":"T. Cazenave","doi":"10.3233/icg-220196","DOIUrl":"https://doi.org/10.3233/icg-220196","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.0,"publicationDate":"2022-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86837480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ringing out the old, ringing in the new","authors":"M. Newborn","doi":"10.3233/ICG-1983-6408","DOIUrl":"https://doi.org/10.3233/ICG-1983-6408","url":null,"abstract":"","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"97 1","pages":"52-54"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86251418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Editorial: Nim, Racing Games and Advances in Computer Games 2021","authors":"T. Cazenave","doi":"10.3233/ICG-220205","DOIUrl":"https://doi.org/10.3233/ICG-220205","url":null,"abstract":"","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"22 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85378654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The algebraic solvability of the novel lamplighter puzzle","authors":"Connor Gregor, D. Ashlock, Allan R. Willms","doi":"10.3233/icg-210195","DOIUrl":"https://doi.org/10.3233/icg-210195","url":null,"abstract":"In this study, the group of finite cyclic lamplighter states is reinterpreted as the novel lamplighter puzzle. The rules of the puzzle are outlined and related back to properties of the lamplighter group with specific interest placed upon the discussion of which puzzle instances are solvable. The paper shows that, through the use of algebra, many puzzle instances can be identified as solvable without the use of an exhaustive search algorithm. Solvability depends upon the creation of irregular generating sets for subgroups of the finite cyclic lamplighter group and the cosets formed by these subgroups. Further possible generalizations of the lamplighter puzzle are also discussed in closing.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"11 1","pages":"203-225"},"PeriodicalIF":0.0,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84901866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Chess without draws","authors":"G. Haworth, T. Cazenave","doi":"10.3233/icg-210188","DOIUrl":"https://doi.org/10.3233/icg-210188","url":null,"abstract":"The prevalence of draws in chess is an increasing concern: in the ICCF’s 2017 ‘MT van Oosteram’ Correspondence event, all 56 games were drawn. This article reports a ‘Mobility Chess’ proposal by ‘Aloril’ which addresses this problem. He prefers to retain his anonymity but should be regarded as the primary author of this paper. He has defined a logical sequence of increasingly subtle and decreasingly rewarded ‘winning’ goals G k . Each position in itself associates with both an immediate achievement A j of goal G j – and an ultimate, best-achievable goal G k , k ⩽ j. Therefore, Aloril has eliminated the draw in Mobility Chess and shown how Chess can reduce the incidence of draws as much as required.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"22 1","pages":"94-101"},"PeriodicalIF":0.0,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74236392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exciting news for the 2021 advances in computer games conference","authors":"","doi":"10.3233/icg-210193","DOIUrl":"https://doi.org/10.3233/icg-210193","url":null,"abstract":"","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"245 1","pages":"135"},"PeriodicalIF":0.0,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80591313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：