Carleton University - School of Computer Science Honours Project
Winter 2019
Game Theory Optimal Strategy: Applications in Six-man No-limit Texas Hold’em Poker
Erik Burton
SCS Honours Project Image
ABSTRACT
This paper provides an overview of No-Limit Texas Hold’em Poker and simpler applications of game theory into card based games. Specifically looking at a strategy called Game Theory Optimal (GTO) which is defines a specific set of actions for any point in the game and that mathematically guarantees the worst-case scenario is to break even (after an infinite amount of rounds). To do this, a game of simpler bounds was analyzed which introducing steady states within pure strategies and a Nash equilibrium when mixed strategies were employed. It also allowed the concept of strategical indifference to be introduced which is a key concept used in the creation of a game theory optimal strategy. This was later was expanded upon to apply graph theory to calculate a hand’s percentage chance of winning which permitted an attempt to calculate part of a game theory optimal strategy within Six-Man No-Limit Texas Hold’em Poker.