GIB:计算博弈中的不完全信息
GIB: Imperfect Information in a Computationally Challenging Game
摘要:
本文探讨了在构建一个玩合同桥博弈的方案中出现的问题。这些问题包括解决游戏的完美信息变量的困难,以及解决桥牌实际上不是完美信息游戏这一事实所需的技术。GIB,该计划被描述,涉及五个独立的技术进步:分区搜索,蒙特卡洛技术的实际应用,以解决问题的蒙特卡洛方法固有的可实现集的重点,从总订单到任意分布格的α-β修剪的扩展,以及使用吱吱作响的车轮优化,以找到近似最优的解决方案纸牌游戏的问题。GIB目前被认为是近似专家的水平,是目前世界上最强大的计算机桥梁程序。
英文摘要:
This paper investigates the problems arising in the construction of a program to play the game of contract bridge. These problems include both the difficulty of solving the game's perfect information variant, and techniques needed to address the fact that bridge is not, in fact, a perfect information game. GIB, the program being described, involves five separate technical advances: partition search, the practical application of Monte Carlo techniques to realistic problems, a focus on achievable sets to solve problems inherent in the Monte Carlo approach, an extension of alpha-beta pruning from total orders to arbitrary distributive lattices, and the use of squeaky wheel optimization to find approximately optimal solutions to cardplay problems. GIB is currently believed to be of approximately expert caliber, and is currently the strongest computer bridge program in the world.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。