社论:麻将、数独和国际象棋

J. Int. Comput. Games Assoc. Pub Date : 2021-01-01 DOI:10.3233/ICG-210178

T. Cazenave

{"title":"社论:麻将、数独和国际象棋","authors":"T. Cazenave","doi":"10.3233/ICG-210178","DOIUrl":null,"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.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Editorial: Mahjong, Sudoku and Chess\",\"authors\":\"T. Cazenave\",\"doi\":\"10.3233/ICG-210178\",\"DOIUrl\":null,\"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.0000,\"publicationDate\":\"2021-01-01\",\"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-210178\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Int. Comput. Games Assoc.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/ICG-210178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

2021年第一期包含两篇科学文章。第一个是王明彦等人的《基于知识和游戏树搜索策略的高效ai麻将游戏方法》，研究的是信息集平均规模巨大的麻将不完全信息游戏。为了接近这个流行的、复杂的、具有挑战性的游戏，作者提出使用对手模型、知识和树搜索。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Editorial: Mahjong, Sudoku and Chess

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

J. Int. Comput. Games Assoc.

自引率

0.00%

发文量