Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal abstraktion i heads up no-limit Texas hold'em.
KTH, School of Computer Science and Communication (CSC).
2012 (Swedish)Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

A good poker player is often associated with an ability to read the opponent. There is despite this a solution to the game of poker. The solution is called a nash equilibrium strategy. Calculating a nash equilibrium strategy for heads up no-limit Texas hold'em is not possible with the computers of today. A method to tackle this is to abstract the game to a simplified game where a nash equilibrium strategy can be calculated. Different ways to abstract the game were compared in this essay. The most promising abstraction was matched against a non-trivial poker bot and managed to win by a good margin.

Abstract [sv]

En bra pokerspelare förknippas ofta med en förmåga att läsa motståndare. Trots detta har alla pokerspel en lösning i form av en nashjämviktsstrategi, som inte tar hänsyn till hur motståndaren spelar. En nashjämviktsstrategi för heads up no-limit poker är inte beräkningsbar med dagens datorer. En metod för att kringgå detta problem är att abstrahera spelet till ett spel där en nashjämviktsstrategi är lättare att beräkna. Den här uppsatsen jämför olika abstraktionsmetoder och redovisar skillnaderna i resultat mellan strategierna framtagna från respektive abstraktionsmetod. Abstraktionsmetoden som visade störst potential ställdes mot en icketrivial pokerbot och lyckades vinna med god marginal.

Place, publisher, year, edition, pages
2012.
Series
Kandidatexjobb CSC, K12020
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-131025OAI: oai:DiVA.org:kth-131025DiVA: diva2:654471
Educational program
Master of Science in Engineering - Computer Science and Technology
Uppsok
Technology
Supervisors
Examiners
Available from: 2013-10-07 Created: 2013-10-07

Open Access in DiVA

No full text

Other links

http://www.csc.kth.se/utbildning/kandidatexjobb/datateknik/2012/rapport/eriksson_dan_K12020.pdf
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 52 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf