We introduce a simple extensive-form algorithm for finding equilibria of two-player, zero-sum games. The algorithm is realization equivalent to a generalized form of Fictitious Play. We compare its performance to that of a similar extensive-form fictitious play algorithm and a counter-factual regret minimization algorithm. All three algorithms share the same advantages over normal-form fictitious play in terms of reducing storage requirements and computational complexity. The new algorithm is intuitive and straightforward to implement, making it an appealing option for those looking for a quick and easy game solving tool.

翻译：我们提出了一种简单的扩展式算法，用于求解双人零和博弈的均衡。该算法在实现上等价于一种广义形式的虚拟博弈。我们将其性能与类似的扩展式虚拟博弈算法以及反事实遗憾最小化算法进行了比较。这三种算法在降低存储需求和计算复杂度方面，均比正规式虚拟博弈具有相同优势。新算法直观且易于实现，成为追求快速便捷博弈求解工具的理想选择。