Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games
Building a high-performance poker-playing program is a challenging project. The best program to date, PsOpti, uses game theory to solve a simplified version of the game. Although the program plays reasonably well, it is oblivious to the opponent’s weaknesses and biases. Modeling the opponent to expl...
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 34 |
|---|---|
| container_issue | |
| container_start_page | 21 |
| container_title | |
| container_volume | |
| creator | Billings, Darse Davidson, Aaron Schauenberg, Terence Burch, Neil Bowling, Michael Holte, Robert Schaeffer, Jonathan Szafron, Duane |
| description | Building a high-performance poker-playing program is a challenging project. The best program to date, PsOpti, uses game theory to solve a simplified version of the game. Although the program plays reasonably well, it is oblivious to the opponent’s weaknesses and biases. Modeling the opponent to exploit predictability is critical to success at poker. This paper introduces Vexbot, a program that uses a game-tree search algorithm to compute the expected value of each betting option, and does real-time opponent modeling to improve its evaluation function estimates. The result is a program that defeats PsOpti convincingly, and poses a much tougher challenge for strong human players. |
| doi_str_mv | 10.1007/11674399_2 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19686628</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19686628</sourcerecordid><originalsourceid>FETCH-LOGICAL-p218t-3ff950cc3f9e6baf966d76b6e06b3b6abc11b65ac240e1eb0736a7095117dafa3</originalsourceid><addsrcrecordid>eNpFkD1PwzAYhM2XRCld-AVZkFgCfuPkdTxWFZSgSgwtc_TatWmg-ZBtCfHvSVUQt9xwz91wjN0AvwfO5QMAylwoVWcnbKZkKYqciywvVXnKJoAAqRC5OmNXf0Epz9mEC56laixeslkIH3yUAFSimLCXJbU23Xhrk7Ulb3bJVxN3yXxLQ6TY9F3SdMk69mZHITYmqdrBemdNTKvO9b49MoeRcM0uHO2Dnf36lL09PW4Wz-nqdVkt5qt0yKCMqXBOFdwY4ZRFTU4hbiVqtBy10EjaAGgsyGQ5t2A1lwJJclUAyC05ElN2e9wdKBjaO0-daUI9-KYl_12DwhIxK0fu7siFMerera9133-GGnh9-LL-_1L8AFP3YPk</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games</title><source>Springer Books</source><creator>Billings, Darse ; Davidson, Aaron ; Schauenberg, Terence ; Burch, Neil ; Bowling, Michael ; Holte, Robert ; Schaeffer, Jonathan ; Szafron, Duane</creator><contributor>Netanyahu, Nathan S. ; Björnsson, Yngvi ; van den Herik, H. Jaap</contributor><creatorcontrib>Billings, Darse ; Davidson, Aaron ; Schauenberg, Terence ; Burch, Neil ; Bowling, Michael ; Holte, Robert ; Schaeffer, Jonathan ; Szafron, Duane ; Netanyahu, Nathan S. ; Björnsson, Yngvi ; van den Herik, H. Jaap</creatorcontrib><description>Building a high-performance poker-playing program is a challenging project. The best program to date, PsOpti, uses game theory to solve a simplified version of the game. Although the program plays reasonably well, it is oblivious to the opponent’s weaknesses and biases. Modeling the opponent to exploit predictability is critical to success at poker. This paper introduces Vexbot, a program that uses a game-tree search algorithm to compute the expected value of each betting option, and does real-time opponent modeling to improve its evaluation function estimates. The result is a program that defeats PsOpti convincingly, and poses a much tougher challenge for strong human players.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540324887</identifier><identifier>ISBN: 9783540324881</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540324898</identifier><identifier>EISBN: 3540324895</identifier><identifier>DOI: 10.1007/11674399_2</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Decision Node ; Exact sciences and technology ; Game Tree ; Information systems. Data bases ; Leaf Node ; Memory organisation. Data processing ; Nash Equilibrium ; Nash Equilibrium Strategy ; Software</subject><ispartof>Computers and Games, 2006, p.21-34</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11674399_2$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11674399_2$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19686628$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Netanyahu, Nathan S.</contributor><contributor>Björnsson, Yngvi</contributor><contributor>van den Herik, H. Jaap</contributor><creatorcontrib>Billings, Darse</creatorcontrib><creatorcontrib>Davidson, Aaron</creatorcontrib><creatorcontrib>Schauenberg, Terence</creatorcontrib><creatorcontrib>Burch, Neil</creatorcontrib><creatorcontrib>Bowling, Michael</creatorcontrib><creatorcontrib>Holte, Robert</creatorcontrib><creatorcontrib>Schaeffer, Jonathan</creatorcontrib><creatorcontrib>Szafron, Duane</creatorcontrib><title>Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games</title><title>Computers and Games</title><description>Building a high-performance poker-playing program is a challenging project. The best program to date, PsOpti, uses game theory to solve a simplified version of the game. Although the program plays reasonably well, it is oblivious to the opponent’s weaknesses and biases. Modeling the opponent to exploit predictability is critical to success at poker. This paper introduces Vexbot, a program that uses a game-tree search algorithm to compute the expected value of each betting option, and does real-time opponent modeling to improve its evaluation function estimates. The result is a program that defeats PsOpti convincingly, and poses a much tougher challenge for strong human players.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Decision Node</subject><subject>Exact sciences and technology</subject><subject>Game Tree</subject><subject>Information systems. Data bases</subject><subject>Leaf Node</subject><subject>Memory organisation. Data processing</subject><subject>Nash Equilibrium</subject><subject>Nash Equilibrium Strategy</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540324887</isbn><isbn>9783540324881</isbn><isbn>9783540324898</isbn><isbn>3540324895</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkD1PwzAYhM2XRCld-AVZkFgCfuPkdTxWFZSgSgwtc_TatWmg-ZBtCfHvSVUQt9xwz91wjN0AvwfO5QMAylwoVWcnbKZkKYqciywvVXnKJoAAqRC5OmNXf0Epz9mEC56laixeslkIH3yUAFSimLCXJbU23Xhrk7Ulb3bJVxN3yXxLQ6TY9F3SdMk69mZHITYmqdrBemdNTKvO9b49MoeRcM0uHO2Dnf36lL09PW4Wz-nqdVkt5qt0yKCMqXBOFdwY4ZRFTU4hbiVqtBy10EjaAGgsyGQ5t2A1lwJJclUAyC05ElN2e9wdKBjaO0-daUI9-KYl_12DwhIxK0fu7siFMerera9133-GGnh9-LL-_1L8AFP3YPk</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Billings, Darse</creator><creator>Davidson, Aaron</creator><creator>Schauenberg, Terence</creator><creator>Burch, Neil</creator><creator>Bowling, Michael</creator><creator>Holte, Robert</creator><creator>Schaeffer, Jonathan</creator><creator>Szafron, Duane</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games</title><author>Billings, Darse ; Davidson, Aaron ; Schauenberg, Terence ; Burch, Neil ; Bowling, Michael ; Holte, Robert ; Schaeffer, Jonathan ; Szafron, Duane</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p218t-3ff950cc3f9e6baf966d76b6e06b3b6abc11b65ac240e1eb0736a7095117dafa3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Decision Node</topic><topic>Exact sciences and technology</topic><topic>Game Tree</topic><topic>Information systems. Data bases</topic><topic>Leaf Node</topic><topic>Memory organisation. Data processing</topic><topic>Nash Equilibrium</topic><topic>Nash Equilibrium Strategy</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Billings, Darse</creatorcontrib><creatorcontrib>Davidson, Aaron</creatorcontrib><creatorcontrib>Schauenberg, Terence</creatorcontrib><creatorcontrib>Burch, Neil</creatorcontrib><creatorcontrib>Bowling, Michael</creatorcontrib><creatorcontrib>Holte, Robert</creatorcontrib><creatorcontrib>Schaeffer, Jonathan</creatorcontrib><creatorcontrib>Szafron, Duane</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Billings, Darse</au><au>Davidson, Aaron</au><au>Schauenberg, Terence</au><au>Burch, Neil</au><au>Bowling, Michael</au><au>Holte, Robert</au><au>Schaeffer, Jonathan</au><au>Szafron, Duane</au><au>Netanyahu, Nathan S.</au><au>Björnsson, Yngvi</au><au>van den Herik, H. Jaap</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games</atitle><btitle>Computers and Games</btitle><date>2006</date><risdate>2006</risdate><spage>21</spage><epage>34</epage><pages>21-34</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540324887</isbn><isbn>9783540324881</isbn><eisbn>9783540324898</eisbn><eisbn>3540324895</eisbn><abstract>Building a high-performance poker-playing program is a challenging project. The best program to date, PsOpti, uses game theory to solve a simplified version of the game. Although the program plays reasonably well, it is oblivious to the opponent’s weaknesses and biases. Modeling the opponent to exploit predictability is critical to success at poker. This paper introduces Vexbot, a program that uses a game-tree search algorithm to compute the expected value of each betting option, and does real-time opponent modeling to improve its evaluation function estimates. The result is a program that defeats PsOpti convincingly, and poses a much tougher challenge for strong human players.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11674399_2</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Computers and Games, 2006, p.21-34 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19686628 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Decision Node Exact sciences and technology Game Tree Information systems. Data bases Leaf Node Memory organisation. Data processing Nash Equilibrium Nash Equilibrium Strategy Software |
| title | Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T08%3A10%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Game-Tree%20Search%20with%20Adaptation%20in%20Stochastic%20Imperfect-Information%20Games&rft.btitle=Computers%20and%20Games&rft.au=Billings,%20Darse&rft.date=2006&rft.spage=21&rft.epage=34&rft.pages=21-34&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540324887&rft.isbn_list=9783540324881&rft_id=info:doi/10.1007/11674399_2&rft_dat=%3Cpascalfrancis_sprin%3E19686628%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540324898&rft.eisbn_list=3540324895&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |