umu.sePublications
Change search
ReferencesLink to record
Permanent link

Direct link
Pseudo-optimal strategies in no-limit poker
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2006 (English)In: ICGA Journal, ISSN 1389-6911, Vol. 29, no 3, 143-149 p.Article in journal (Refereed) PublishedText
Abstract [en]

Games have always been a strong driving force in Artificial Intelligence. In the last ten years huge improvements has been made in perfect information games like chess and Othello. The strongest computer agents can nowadays beat the strongest human players. This is not the case for imperfect information games such as poker and bridge where creating an expert computer player has shown to be much harder. Previous research in poker has either addressed limit poker or simplified variations of poker games. This paper tries to extend known techniques successfully used in limit poker to no-limit. No-limit poker increases the size of the game tree drastically. To reduce the complexity an abstracted model of the game is created. Finding an optimal strategy for the new model is now a minimization problem using linear programming techniques. The result is a set of pseudo-optimal strategies for no-limit Texas Hold'em. A bot named AGGROBOT was built from these strategies which perform well as long as the players' stack sizes are fairly small.

Place, publisher, year, edition, pages
Maastricht: UNIV MAASTRICHTUniversity of Maastricht, Faculty of general sciences , 2006. Vol. 29, no 3, 143-149 p.
National Category
Computer Science Software Engineering
Identifiers
URN: urn:nbn:se:umu:diva-119383ISI: 000242375600003OAI: oai:DiVA.org:umu-119383DiVA: diva2:928550
Available from: 2016-05-16 Created: 2016-04-18 Last updated: 2016-05-16Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Andersson, Rickard
By organisation
Department of Computing Science
In the same journal
ICGA Journal
Computer ScienceSoftware Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link