Successful performance via decision generalisation in no limit texas hold'em

  • Authors:
  • Jonathan Rubin;Ian Watson

  • Affiliations:
  • Department of Computer Science, University of Auckland, New Zealand;Department of Computer Science, University of Auckland, New Zealand

  • Venue:
  • ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a set of data, recorded by observing the decisions of an expert player, we present a case-based framework that allows the successful generalisation of those decisions in the game of no limit Texas Hold'em. The transition from a limit betting structure to a no limit betting structure offers challenging problems that are not faced in the limit domain. In particular, we address the problems of determining a suitable action abstraction and the resulting state translation that is required to map real-value bet amounts into a discrete set of abstract actions. We also detail the similarity metrics used in order to identify similar scenarios, without which no generalisation of playing decisions would be possible. We show that we were able to successfully generalise no limit betting decisions from recorded data via our agent, SartreNL, which achieved a 2nd place finish at the 2010 Annual Computer Poker Competition.