Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games

Understand

Online game playing algorithms produce high-quality strategies with a fraction of memory and computation required by their offline alternatives.

• Continual Resolving (CR) is a recent theoretically sound approach to online game playing that has been used to outperform human professionals in poker.
• However, parts of the algorithm were specific to poker, which enjoys many properties not shared by other imperfect information games.
• We present a domain-independent formulation of CR applicable to any two-player zero-sum extensive-form games that works with an abstract resolving algorithm.