A fundamental challenge in imperfect-information games is that states do not
have well-defined values. As a result, depth-limited search algorithms used in
single-agent settings and perfect-information games do not apply. This paper
introduces a principled way to conduct depth-limited solving in
imperfect-information games by allowing the opponent to choose among a number
of strategies for the remainder of the game at the depth limit. Each one of
these strategies results in a different set of values for leaf nodes. This
forces an agent to be robust to the different strategies an opponent may
employ. We demonstrate the effectiveness of this approach by building a
master-level heads-up no-limit Texas hold'em poker AI that defeats two prior
top agents using only a 4-core CPU and 16 GB of memory. Developing such a
powerful agent would have previously required a supercomputer.

该篇论文提出了一种通过让对手在深度限制处选择多个策略之一来在不完美信息游戏中进行有原则的深度限制求解的方法，证明了这种方法的有效性，并建立了一个仅使用 4 核 CPU 和 16GB 内存就可以击败之前的两个顶级代理的大师级德州扑克 AI。