{"title":"TCEC Cup 8","authors":"G. Haworth, Nelson Hernandez","doi":"10.3233/ICG-210185","DOIUrl":"https://doi.org/10.3233/ICG-210185","url":null,"abstract":"","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"2014 1","pages":"88-91"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86551442","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}
Just like last year, Season 20 DivP gathered a host of familiar faces and once again, one of those faces had a facelift! The venerable KOMODO engine had been given an NNUE beauty boost and there was a feeling that KOMODO DRAGON might prove a threat to LEELA’s and STOCKFISH’s customary tickets to the Superfinal. There was also an updated STOOFVLEES to enjoy while ETHEREAL came storming back to DivP after a convincing victory in League 1. ROFCHADE just pipped NNUE-powered IGEL on tiebreak for the second DivP spot.
{"title":"The TCEC20 Computer Chess Superfinal: A perspective","authors":"G. M. M. Sadler","doi":"10.3233/ICG-210184","DOIUrl":"https://doi.org/10.3233/ICG-210184","url":null,"abstract":"Just like last year, Season 20 DivP gathered a host of familiar faces and once again, one of those faces had a facelift! The venerable KOMODO engine had been given an NNUE beauty boost and there was a feeling that KOMODO DRAGON might prove a threat to LEELA’s and STOCKFISH’s customary tickets to the Superfinal. There was also an updated STOOFVLEES to enjoy while ETHEREAL came storming back to DivP after a convincing victory in League 1. ROFCHADE just pipped NNUE-powered IGEL on tiebreak for the second DivP spot.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"6 1","pages":"74-87"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88811698","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}
Mingyan Wang, Hang Ren, Wei Huang, Taiwei Yan, Jiewei Lei, Jiayang Wang
The Mahjong game has widely been acknowledged to be a difficult problem in the field of imperfect information games. Because of its unique characteristics of asymmetric, serialized and multi-player game information, conventional methods of dealing with perfect information games are difficult to be applied directly on the Mahjong game. Therefore, AI (artificial intelligence)-based studies to handle the Mahjong game become challenging. In this study, an efficient AI-based method to play the Mahjong game is proposed based on the knowledge and game-tree searching strategy. Technically, we simplify the Mahjong game framework from multi-player to single-player. Based on the above intuition, an improved search algorithm is proposed to explore the path of winning. Meanwhile, three node extension strategies are proposed based on heuristic information to improve the search efficiency. Then, an evaluation function is designed to calculate the optimal solution by combining the winning rate, score and risk value assessment. In addition, we combine knowledge and Monte Carlo simulation to construct an opponent model to predict hidden information and translate it into available relative probabilities. Finally, dozens of experiments are designed to prove the effectiveness of each algorithm module. It is also worthy to mention that, the first version of the proposed method, which is named as KF-TREE, has won the silver medal in the Mahjong tournament of 2019 Computer Olympiad.
{"title":"An efficient AI-based method to play the Mahjong game with the knowledge and game-tree searching strategy","authors":"Mingyan Wang, Hang Ren, Wei Huang, Taiwei Yan, Jiewei Lei, Jiayang Wang","doi":"10.3233/ICG-210179","DOIUrl":"https://doi.org/10.3233/ICG-210179","url":null,"abstract":"The Mahjong game has widely been acknowledged to be a difficult problem in the field of imperfect information games. Because of its unique characteristics of asymmetric, serialized and multi-player game information, conventional methods of dealing with perfect information games are difficult to be applied directly on the Mahjong game. Therefore, AI (artificial intelligence)-based studies to handle the Mahjong game become challenging. In this study, an efficient AI-based method to play the Mahjong game is proposed based on the knowledge and game-tree searching strategy. Technically, we simplify the Mahjong game framework from multi-player to single-player. Based on the above intuition, an improved search algorithm is proposed to explore the path of winning. Meanwhile, three node extension strategies are proposed based on heuristic information to improve the search efficiency. Then, an evaluation function is designed to calculate the optimal solution by combining the winning rate, score and risk value assessment. In addition, we combine knowledge and Monte Carlo simulation to construct an opponent model to predict hidden information and translate it into available relative probabilities. Finally, dozens of experiments are designed to prove the effectiveness of each algorithm module. It is also worthy to mention that, the first version of the proposed method, which is named as KF-TREE, has won the silver medal in the Mahjong tournament of 2019 Computer Olympiad.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"1 1","pages":"2-25"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90317270","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}
Chess960 time at the Top Chess Engine Championship (TCEC, 2021a)! The more I watch these games, the more I feel that the gap between humans and engines is even higher in Chess960 than in normal chess. I loved the opening phase of this game between two of the less famous engines on show. I’m not sure I would have thought of any of Black’s moves! The game VAJOLET2 – SLOWCHESS BLITZ is available for replay and download (TCEC, 2021b).
{"title":"Chess960 Superhumans!","authors":"G. M. M. Sadler","doi":"10.3233/ICG-210182","DOIUrl":"https://doi.org/10.3233/ICG-210182","url":null,"abstract":"Chess960 time at the Top Chess Engine Championship (TCEC, 2021a)! The more I watch these games, the more I feel that the gap between humans and engines is even higher in Chess960 than in normal chess. I loved the opening phase of this game between two of the less famous engines on show. I’m not sure I would have thought of any of Black’s moves! The game VAJOLET2 – SLOWCHESS BLITZ is available for replay and download (TCEC, 2021b).","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"75 1","pages":"57-61"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79985026","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}
This first issue of 2021 contains two scientific articles. The first one An Efficient AI-based Method to Play the Mahjong Game with the Knowledge and Game-tree Searching Strategy by Mingyan Wang et al. deals with the imperfect information game of Mahjong which has a huge average size of information sets. In order to approach this popular, complex and challenging game, the authors propose to use opponent models, knowledge and tree search.
{"title":"Editorial: Mahjong, Sudoku and Chess","authors":"T. Cazenave","doi":"10.3233/ICG-210178","DOIUrl":"https://doi.org/10.3233/ICG-210178","url":null,"abstract":"This first issue of 2021 contains two scientific articles. The first one An Efficient AI-based Method to Play the Mahjong Game with the Knowledge and Game-tree Searching Strategy by Mingyan Wang et al. deals with the imperfect information game of Mahjong which has a huge average size of information sets. In order to approach this popular, complex and challenging game, the authors propose to use opponent models, knowledge and tree search.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"91 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91528010","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}
T. Cazenave, J. Herik, Abdallah Saffidine, I-Chen Wu
The Advances in Computer Games conference series is a major international forum for researchers and developers interested in all aspects of artificial intelligence and computer game playing. Earlier conferences took place in London (1975), Edinburgh (1978), London (1981, 1984), Noordwijkerhout (1987), London (1990), Maastricht (1993, 1996), Paderborn (1999), Graz (2003), Taipei (2005), Pamplona (2009), Tilburg (2011), and Leiden (2015, 2017).
{"title":"The ACG 2019 Conference","authors":"T. Cazenave, J. Herik, Abdallah Saffidine, I-Chen Wu","doi":"10.3233/icg-200171","DOIUrl":"https://doi.org/10.3233/icg-200171","url":null,"abstract":"The Advances in Computer Games conference series is a major international forum for researchers and developers interested in all aspects of artificial intelligence and computer game playing. Earlier conferences took place in London (1975), Edinburgh (1978), London (1981, 1984), Noordwijkerhout (1987), London (1990), Maastricht (1993, 1996), Paderborn (1999), Graz (2003), Taipei (2005), Pamplona (2009), Tilburg (2011), and Leiden (2015, 2017).","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"9 1","pages":"291-294"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82680311","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：