{"title":"Applying Importance Sampling to MCTS for Mahjong","authors":"Shih-Chieh Tang;Jr-Chang Chen;I-Chen Wu","doi":"10.1109/TG.2025.3535740","DOIUrl":null,"url":null,"abstract":"<italic>Mahjong</i> is a four-player stochastic imperfect-information game. In this article, we utilize importance sampling within Monte Carlo tree search (MCTS) to enhance the playing strength of our <italic>Mahjong</i> program, <sc>MeowCaTS</small>. First, we propose a tree structure called the merging solitary tile model, which facilitates the application of importance sampling. This model also reduces the branching factor of the search tree. Second, we apply importance sampling to MCTS and introduce the calculation of importance weights during the backpropagation stage. Finally, we design a multidepth transposition table to accumulate simulation results of similar positions in MCTS, further enhancing the strength of <sc>MeowCaTS</small>. In the experiments, the performance of the proposed methods was analyzed, and the results showed a significant improvement. Notably, <sc>MeowCaTS</small> won the first place in Computer Olympiad 2023.","PeriodicalId":55977,"journal":{"name":"IEEE Transactions on Games","volume":"17 3","pages":"743-752"},"PeriodicalIF":2.8000,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Games","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10856513/","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Mahjong is a four-player stochastic imperfect-information game. In this article, we utilize importance sampling within Monte Carlo tree search (MCTS) to enhance the playing strength of our Mahjong program, MeowCaTS. First, we propose a tree structure called the merging solitary tile model, which facilitates the application of importance sampling. This model also reduces the branching factor of the search tree. Second, we apply importance sampling to MCTS and introduce the calculation of importance weights during the backpropagation stage. Finally, we design a multidepth transposition table to accumulate simulation results of similar positions in MCTS, further enhancing the strength of MeowCaTS. In the experiments, the performance of the proposed methods was analyzed, and the results showed a significant improvement. Notably, MeowCaTS won the first place in Computer Olympiad 2023.