AWhat changed
Introduced clipped cumulative regret-matching updates and weighted averaging, then combined distributed compressed computation with CFR+ to essentially weakly solve heads-up limit Texas hold'em.
Scientific scope
Introduced clipped cumulative regret-matching updates and weighted averaging, then combined distributed compressed computation with CFR+ to essentially weakly solve heads-up limit Texas hold'em. The2014algorithm originates with Tammelin alone; subsequent theory/engineering and Cepheus reports have their own bylines. Same asymptotic regret order does not prove a universal order-of-magnitude acceleration. Essentially weakly solved means a quantified very small exploitability, not an exact equilibrium or no-limit/multiplayer poker solution.
Evidence
The linked original sources describe the stated contribution and its evidence limits. WRS has not independently rerun the experiments or certified a proof. The2014algorithm originates with Tammelin alone; subsequent theory/engineering and Cepheus reports have their own bylines. Same asymptotic regret order does not prove a universal order-of-magnitude acceleration. Essentially weakly solved means a quantified very small exploitability, not an exact equilibrium or no-limit/multiplayer poker solution.
Contributors
- Source-listed authors and technical contributors · SCIENCE: Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
- Solving Large Imperfect Information Games Using CFR+
- Solving Heads-up Limit Texas Hold'em
- Heads-Up Limit Hold'em Poker Is Solved
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction