Abstract
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 A
Get full access to this article
View all access options for this article.