Search Results for author: Oskari Tammelin

Found 1 papers, 1 papers with code

Solving Large Imperfect Information Games Using CFR+

2 code implementations18 Jul 2014 Oskari Tammelin

Counterfactual Regret Minimization and variants (e. g. Public Chance Sampling CFR and Pure CFR) have been known as the best approaches for creating approximate Nash equilibrium solutions for imperfect information games such as poker.

Computer Science and Game Theory

Cannot find the paper you are looking for? You can Submit a new open access paper.