期刊文献+

一种德州扑克牌力评估方法 被引量:4

A Method of Evaluating Texas Hold’Em Poker
下载PDF
导出
摘要 德州扑克是一种计算机博弈牌类项目,作为不完美信息博弈,其牌力评估较为困难。为了提高针对不同对手的评估效益,提出一种基于对手模型的牌力评估方法。首先用树存储对手的动作频率信息,然后根据树构建一个与对手行动类似的虚拟对手智能体,最后在对局中计算虚拟对手的策略,更新对手的手牌权重,缩小对手可能手牌范围,完成牌力评估。实验结果显示:使用基于对手模型牌力评估方法的智能体击败了不同风格的对手,且总体赢得的筹码比使用静态评估方法的智能体高。与传统方法相比能有效针对不同的对手类型,提高评估效益。 Texas Hold’em poker is a kind of card game in computer games.As an imperfect information game,it is difficult to evaluate the card strength.In order to improve the evaluation efficiency when versus different opponents,a new method based on opponent model is proposed.Firstly,the tree is used to store the information of the opponent’s action frequency,and then construct a virtual agent whose action is similar to the opponent’s.Finally,after calculating the virtual opponent’s strategy in the game and updating the weight of opponent’s hand cards,the opponent’s possible hand range is reduced so that we can complete the card strength evaluation.The experiments show that agent using the evaluation method based opponent model beat opponents with different styles,and the overall winning chips are higher than the agent using static evaluation method.Compared with traditional methods,it can effectively target different opponents and improve the evaluation efficiency.
作者 张小川 杜松 赵海璐 刘贺 伍帆 ZHANG Xiaochuan;DU Song;ZHAO Hailu;LIU He;WU Fan(School of Artificial Intelligence, Chongqing University of Technology, Chongqing 401135, China;School of Computer Science and Engineering, Chongqing University of Technology, Chongqing 400054, China)
出处 《重庆理工大学学报(自然科学)》 北大核心 2021年第9期130-135,共6页 Journal of Chongqing University of Technology:Natural Science
基金 NSFC青基项目(61702063) 重庆市自然科学基金项目(cstc2019jcyj-msxmX0544)。
关键词 牌力评估 德州扑克 对手模型 计算机博弈 hand evaluation Texas Hold’em poker opponent model computer game
  • 相关文献

参考文献6

二级参考文献20

  • 1彭春光,鞠儒生,杨建池,黄柯棣.现代兵棋推演技术分析[J].系统仿真学报,2009,21(S2):97-100. 被引量:22
  • 2沈海波,洪帆.Web服务中结合XACML的基于属性的访问控制模型[J].计算机应用,2005,25(12):2765-2767. 被引量:8
  • 3AVIEZW S. FRAENKEL. Computing a perfect strategy for n × n chess requires time exponential in n[ J]. JOUR- NAL OF COMBINATORIAL THEORY, Series A 32, 1981:299 -214. 被引量:1
  • 4Robson J M. N by N Checkers is EXPTIME complete [J]. SIAM Journal on Computing, 1984, 13 (2):252 - 267. 被引量:1
  • 5STOCKMEYER L J, CHANDRA A K. Provably difficult combinatorial games[ J]. SIAM J. Compuf, 1979 (8) : 151 -174. 被引量:1
  • 6Lichtenstein D, Sipser M. Go is polynomial-space hard [J]. Journal of the ACM,1980(27) :393 -401. 被引量:1
  • 7Reisch S. Gobang ist PSPACE-vollstandig (Gobang is PSPACE-complete) [ J ]. Acta Informatica, 1980 ( 13 ) : 59 --66. 被引量:1
  • 8Ming Yu Hsieh,Shi-Chun Tsai. On the fairness and com- plexity of generalized k-in-a-row games [ J ]. Theoretical Computer Science, 2007(385) : 88 - 100. 被引量:1
  • 9Iwata S, Kasai T. The Othello game on an n × n board is PSPACE-complete [ J ]. Theoretical Computer Science, 1994 (123) : 329 - 340. 被引量:1
  • 10Michael Sipser. Introduction to the Theory of Computation ( Second Edition) [ M]. China Machine Press ,2006. 被引量:1

共引文献5

同被引文献15

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部