标题:A strategy based on probability theory for poker game
作者:Han, Aili ;Zhuang, Qifu ;Han, Feilin
通讯作者:Han, A
作者机构:[Han, Aili ;Zhuang, Qifu ] Department of Computer Science, Shandong University, Weihai 264209, China;[Han, Feilin ] College of Software, Shandong Univ 更多
会议名称:IET International Conference on Information Science and Control Engineering 2012, ICISCE 2012
会议日期:7 December 2012 through 9 December 2012
来源:IET Conference Publications
出版年:2012
卷:2012
期:636 CP
DOI:10.1049/cp.2012.2355
关键词:Incomplete information; Man-machine game; Search strategy
摘要:Poker game is one of the man-machine games with incomplete information. This paper presents a search strategy for poker game based on the theories of probability and game tree. It estimates every possible strategy opponents made in one round on the basis of the existing information and constructs a game tree. And then it computes the probability of realizing the purpose of playing this card at each turn based on the game tree and probability theory. According to this information, it determines the strategy at each round and constructs a game tree with weights. In this tree, each node represents one round, and the weight on each node represents the probability of getting the right of playing the card at first in the next round. The route from the root to each leaf shows a complete strategy, and the product of weights at each route gives the probability of success using this strategy. Finally, it finds an effective strategy through comparing the probability of success at each route.
收录类别:EI;SCOPUS
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894569184&doi=10.1049%2fcp.2012.2355&partnerID=40&md5=741eb2d6de281f8412dfb8b980e2defc
TOP