arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.06832cs.AIcs.DMcs.MA
收藏

一种计算麻将牌缺数的快速算法

A Fast Algorithm for Computing the Deficiency Number of a Mahjong Hand

Shaanxi Normal University(陕西师范大学);University of Technology Sydney(悉尼科技大学)

Xueqing Yan, Yongming Li, Sanjiang Li

摘要:

麻将是一种基于瓷砖的多人游戏,在亚洲广泛流行,在全球也越来越受欢迎。面对面或在线,每个玩家从13张牌开始,玩家依次抽牌和弃牌,直到他们完成一个获胜的手牌。麻将中的一个重要概念是亏数(也称为亏数)。日本麻将中的shanten数),它估计需要多少张牌才能将手牌变成获胜手牌。亏数在重大决策任务中起着至关重要的作用,例如选择要丢弃的瓦片。提出了一种计算麻将牌不足数的快速算法。与基线算法相比,新算法通常快100倍,更重要的是,尊重代理关于可用瓷砖的知识。该算法可以作为基于规则和基于机器学习的麻将AI的所有麻将变体的基本程序。

英文摘要:

The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number (a.k.a. shanten number in Japanese Mahjong) of a hand, which estimates how many tile changes are necessary to complete the hand into a winning hand. The deficiency number plays an essential role in major decision-making tasks such as selecting a tile to discard. This paper proposes a fast algorithm for computing the deficiency number of a Mahjong hand. Compared with the baseline algorithm, the new algorithm is usually 100 times faster and, more importantly, respects the agent's knowledge about available tiles. The algorithm can be used as a basic procedure in all Mahjong variants by both rule-based and machine learning-based Mahjong AI.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑