Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions

NeurIPS 2012 Neil BurchMarc LanctotDuane SzafronRichard G. Gibson

Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing strategies in extensive-form games. The Monte Carlo CFR (MCCFR) variants reduce the per iteration time cost of CFR by traversing a sampled portion of the tree... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.