What is recorded here?
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.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
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.
Read the original work
- Solving Large Imperfect Information Games Using CFR+
- Solving Heads-up Limit Texas Hold'em
- Heads-Up Limit Hold'em Poker Is Solved
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Oskari Tammelin; Neil Burch; Michael Johanson; Michael Bowling
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.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
CFR+ and Cepheus: scalable near-equilibrium poker solving
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
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.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Oskari Tammelin; Neil Burch; Michael Johanson; Michael Bowling
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.