{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:34:01Z","timestamp":1768534441872,"version":"3.49.0"},"reference-count":16,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ICG"],"published-print":{"date-parts":[[2021,5,26]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3233\/icg-210179","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T12:39:23Z","timestamp":1621946363000},"page":"2-25","source":"Crossref","is-referenced-by-count":7,"title":["An efficient AI-based method to play the Mahjong game with the knowledge and game-tree searching strategy"],"prefix":"10.1177","volume":"43","author":[{"given":"Mingyan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Information Engineering, Nanchang University, Nanchang, Jiangxi, China"}]},{"given":"Hang","family":"Ren","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang University, Nanchang, Jiangxi, China"}]},{"given":"Wei","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang University, Nanchang, Jiangxi, China"}]},{"given":"Taiwei","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang University, Nanchang, Jiangxi, China"}]},{"given":"Jiewei","family":"Lei","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang University, Nanchang, Jiangxi, China"}]},{"given":"Jiayang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Jiangxi Argricultural University, Nanchang, Jiangxi, China"}]}],"member":"179","reference":[{"issue":"6218","key":"10.3233\/ICG-210179_ref1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1126\/science.1259433","article-title":"Heads-up limit hold\u2019em poker is solved","volume":"347","author":"Bowling","year":"2015","journal-title":"Science"},{"issue":"1\u20132","key":"10.3233\/ICG-210179_ref2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00129-1","article-title":"Deep blue","volume":"134","author":"Campbell","year":"2002","journal-title":"Artificial intelligence"},{"key":"10.3233\/ICG-210179_ref3","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/11922155_9","article-title":"A phantom-go program","volume":"4250","author":"Cazenave","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"issue":"11","key":"10.3233\/ICG-210179_ref5","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.artint.2010.04.017","article-title":"Monte Carlo tree search in Kriegspiel","volume":"174","author":"Ciancarini","year":"2010","journal-title":"Artificial Intelligence."},{"key":"10.3233\/ICG-210179_ref6","first-page":"43","volume-title":"Supervised Learning of Imperfect Information Data in the Game of Mahjong via Deep Convolutional Neural Networks","author":"Gao","year":"2018"},{"key":"10.3233\/ICG-210179_ref10","unstructured":"Miki, A., Miwa, M. & Chikayama, T. (2008). Learning to rank moves in mahjong using SVM with tree kernels. In Proceedings of the 13th Game Programming Workshop (pp. 60\u201366). https:\/\/ipsj.ixsq.nii.ac.jp\/ej\/?action=repository_uri&item_id=97690&file_id=1&file_no=1."},{"issue":"11","key":"10.3233\/ICG-210179_ref11","first-page":"1","article-title":"Realizing a four-player computer Mahjong program by supervised learning with isolated multi-player aspects","volume":"55","author":"Mizukami","year":"2014","journal-title":"Transactions of Information Processing Society of Japan"},{"issue":"6337","key":"10.3233\/ICG-210179_ref12","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1126\/science.aam6960","article-title":"Deepstack: Expert-level artificial intelligence in heads-up no-limit poker","volume":"356","author":"Moravc\u02d8\u00edk","year":"2017","journal-title":"Science"},{"issue":"1","key":"10.3233\/ICG-210179_ref13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.3233\/ICG-2013-36102","article-title":"Search policies in multi-player games","volume":"36","author":"Nijssen","year":"2013","journal-title":"ICGA Journal"},{"issue":"2\u20133","key":"10.3233\/ICG-210179_ref14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(92)90074-8","article-title":"A world championship caliber checkers program","volume":"53","author":"Schaeffer","year":"1992","journal-title":"Artificial Intelligence."},{"issue":"1","key":"10.3233\/ICG-210179_ref15","doi-asserted-by":"publisher","first-page":"44","DOI":"10.3233\/ICG-2014-37111","article-title":"A framework for computer mahjong competitions","volume":"37","author":"Shan","year":"2014","journal-title":"ICGA Journal"},{"key":"10.3233\/ICG-210179_ref17","unstructured":"The World Mahjong Organization (2014). Mahjoan Competition Rules. Chinese Publishing Company. http:\/\/www.mindMahjong.com\/adobe\/20141120CEJ.pdf."},{"issue":"3","key":"10.3233\/ICG-210179_ref18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.3233\/ICG-2002-25304","article-title":"Game-tree search algorithm based on realization probability","volume":"25","author":"Tsuruoka","year":"2002","journal-title":"ICGA Journal"},{"key":"10.3233\/ICG-210179_ref19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","article-title":"Zur theorie der gesellschaftsspiele","volume":"100","author":"Von Neumann","year":"1928","journal-title":"Mathematische Annalen"},{"issue":"12","key":"10.3233\/ICG-210179_ref20","first-page":"1","article-title":"Estimating risk of discarded tiles in Mahjong using SVR. The special interest group technical reports of IPSJ","volume":"2014","author":"Wagatsuma","year":"2014","journal-title":"GI,[Game Informatics]"},{"issue":"16","key":"10.3233\/ICG-210179_ref21","doi-asserted-by":"publisher","first-page":"23443","DOI":"10.1007\/s11042-019-7682-5","article-title":"A novel deep residual network-based incomplete information competition strategy for four-players Mahjong games","volume":"78","author":"Wang","year":"2019","journal-title":"Multimedia Tools and Applications"}],"container-title":["ICGA Journal"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/ICG-210179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T07:00:25Z","timestamp":1760338825000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/ICG-210179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,26]]},"references-count":16,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/icg-210179","relation":{},"ISSN":["2468-2438","1389-6911"],"issn-type":[{"value":"2468-2438","type":"electronic"},{"value":"1389-6911","type":"print"}],"subject":[],"published":{"date-parts":[[2021,5,26]]}}}