首页> 外文会议>International Conference on Computers and Games >Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games
【24h】

Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games

机译:在随机缺席信息游戏中的适应游戏树搜索

获取原文

摘要

Building a high-performance poker-playing program is a challenging project. The best program to date, PsOpti, uses game theory to solve a simplified version of the game. Although the program plays reasonably well, it is oblivious to the opponent’s weaknesses and biases. Modeling the opponent to exploit predictability is critical to success at poker. This paper introduces Vexbot, a program that uses a game-tree search algorithm to compute the expected value of each betting option, and does real-time opponent modeling to improve its evaluation function estimates. The result is a program that defeats PsOpti convincingly, and poses a much tougher challenge for strong human players.
机译:建立高性能扑克播放计划是一个具有挑战性的项目。迄今为止的最佳计划Psopti,使用博弈论来解决一个简化的游戏版本。虽然该计划合理地播放,但它对对手的弱点和偏见感到遗憾。建模对手利用可预测性对于扑克成功至关重要。本文介绍了Vexbot,该程序使用游戏树搜索算法来计算每个投注选项的预期值,并且实时对手建模以改善其评估功能估计。结果是一个令人信服地击败PSOPTI的计划,对强大的人类参与者构成了更加艰难的挑战。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号