Schweizer, Immanuel ; Panitzek, Kamill ; Park, Sang-Hyeun ; Fürnkranz, Johannes (2009)
An Exploitative Monte-Carlo Poker Agent.
Report, Bibliographie
Kurzbeschreibung (Abstract)
The poker agent AKI-REALBOT described in this paper was designed to participate in the 6-player Limit competition which was part of the Computer Poker Challenge at the AAAI 2008 conference.It ended up in second place, its performance being mostly due to its ability to exploit weaker bots and still play fairly well against stronger players. This paper describes the architecture of the program and the Monte-Carlo decision tree-based decision engine that was used to make the bot’s decision. It will focus the attention on the modifications which made the bot successful in exploiting weaker bots.
| Typ des Eintrags: | Report |
|---|---|
| Erschienen: | 2009 |
| Autor(en): | Schweizer, Immanuel ; Panitzek, Kamill ; Park, Sang-Hyeun ; Fürnkranz, Johannes |
| Art des Eintrags: | Bibliographie |
| Titel: | An Exploitative Monte-Carlo Poker Agent |
| Sprache: | Englisch |
| Publikationsjahr: | 2009 |
| URL / URN: | http://www.ke.informatik.tu-darmstadt.de/publications/report... |
| Kurzbeschreibung (Abstract): | The poker agent AKI-REALBOT described in this paper was designed to participate in the 6-player Limit competition which was part of the Computer Poker Challenge at the AAAI 2008 conference.It ended up in second place, its performance being mostly due to its ability to exploit weaker bots and still play fairly well against stronger players. This paper describes the architecture of the program and the Monte-Carlo decision tree-based decision engine that was used to make the bot’s decision. It will focus the attention on the modifications which made the bot successful in exploiting weaker bots. |
| ID-Nummer: | TUD-KE-2009-02 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Knowledge Engineering |
| Hinterlegungsdatum: | 24 Jun 2011 14:43 |
| Letzte Änderung: | 26 Aug 2018 21:26 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum