Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning
AAAI Workshops, 2017.
Counterfactual Regret Minimization (CFR) is the most popular iterative algorithm for solving zero-sum imperfect-information games. Regret-Based Pruning (RBP) is an improvement that allows poorly-performing actions to be temporarily pruned, thus speeding up CFR. We introduce Total RBP, a new form of RBP that reduces the space requirements ...More
Full Text (Upload PDF)
PPT (Upload PPT)