Poker Learner: Reinforcement Learning Applied to Texas Hold'em Poker

Bibliografia: p. 61-66Tese de Mestrado Integrado. Engenharia Informática e Computação. Universidade do Porto. Faculdade de Engenharia.. 201

Toward Legalization of Poker: The Skill vs. Chance Debate

This paper sheds light on the age-old argument as to whether poker is a game in which skill predominates over chance or vice versa. Recent work addressing the issue of skill vs. chance is reviewed. This current study considers two different scenarios to address the issue: 1) a mathematical analysis supported by computer simulations of one random player and one skilled player in Texas Hold\u27Em, and 2) full-table simulation games of Texas Hold\u27Em and Seven Card Stud. Findings for scenario 1 showed the skilled player winning 97 percent of the hands. Findings for scenario 2 further reinforced that highly skilled players convincingly beat unskilled players. Following this study that shows poker as predominantly a skill game, various gaming jurisdictions might declare poker as such, thus legalizing and broadening the game for new venues, new markets, new demographics, and new media. Internet gaming in particular could be expanded and released from its current illegality in the U.S. with benefits accruing to casinos who wish to offer online poker

Using a high-level language to build a poker playing agent

Tese de mestrado integrado. Engenharia Informática e Computação. Faculdade de Engenharia. Universidade do Porto. 200

An intelligent poker-agent for Texas Hold'em

Estágio realizado em Budapest University of Technology and Economics e orientado por Dániel László KovácsTese de mestrado integrado. Engenharia Informátca e Computação. Faculdade de Engenharia. Universidade do Porto. 200

Building a poker playing agent based on game logs using supervised learning

Tese de mestrado integrado. Engenharia Informática e Computação. Faculdade de Engenharia. Universidade do Porto. 201

Building a computer poker agent with emphasis on opponent modeling

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (pages 53-54).In this thesis, we present a computer agent for the game of no-limit Texas Hold'em Poker for two players. Poker is a partially observable, stochastic, multi-agent, sequential game. This combination of characteristics makes it a very challenging game to master for both human and computer players. We explore this problem from an opponent modeling perspective, using data mining to build a database of player styles that allows our agent to quickly model the strategy of any new opponent. The opponent model is then used to develop a robust counter strategy. A simpler version of this agent modified for a three player game was able to win the 2011 MIT Poker Bot Competition.by Jian Huang.M. Eng

HoldemML: A framework to generate No Limit Hold'em Poker agents from human player strategies

Developing computer programs that play Poker at human level is considered to be challenge to the A.I research community, due to its incomplete information and stochastic nature. Due to these characteristics of the game, a competitive agent must manage luck and use opponent modeling to be successful at short term and therefore be profitable. In this paper we propose the creation of No Limit Hold'em Poker agents by copying strategies of the best human players, by analyzing past games between them. To accomplish this goal, first we determine the best players on a set of game logs by determining which ones have higher winning expectation. Next, we define a classification problem to represent the player strategy, by associating a game state with the performed action. To validate and test the defined player model, the HoldemML framework was created. This framework generates agents by classifying the data present on the game logs with the goal to copy the best human player tactics. The created agents approximately follow the tactics from the counterpart human player, thus validating the defined player model. However, this approach proved to be insufficient to create a competitive agent, since the generated strategies were static, which means that they are easy prey to opponents that can perform opponent modeling. This issue can be solved by combining multiple tactics from different players. This way, the agent switches the tactic from time to time, using a simple heuristic, in order to confuse the opponent modeling mechanisms

Poker as a testbed for machine intelligence research

ABSTRACT For years, games researchers have used chess, checkers and other board games as a testbed for machine intelligence research. The success of world-championship-caliber programs for these games has resulted in a number of interesting games being overlooked. Specifically, we show that poker can serve as a better testbed for machine intelligence research related to decision making problems. Poker is a game of imperfect knowledge, where multiple competing agents must deal with risk management, agent modeling, unreliable information and deception, much like decision-making applications in the real world. The heuristic search and evaluation methods successfully employed in chess are not helpful here. This paper outlines the difficulty of playing strong poker, and describes our first steps towards building a world-class poker-playing program