Generating beginner heuristics for simple Texas hold'em

Fernando De Mesentier Silva, Frank Lantz, Julian Togelius, Andy Nealen

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Beginner heuristics for a game are simple rules that allow for effective playing. A chain of beginner heuristics of length N is the list of N rules that play the game best. Finding beginner heuristics is useful both for teaching a novice to play the game well and for understanding the dynamics of the game. We present and compare methods for finding beginner heuristics in a simple version of Poker: Pre-Flop Heads-Up Limit Texas Hold'em. We find that genetic programming outperforms greedy-exhaustive search and axis-aligned search in terms of finding well-playing heuristic chains of given length. We also find that there is a limited amount of non-transitivity when playing beginner heuristics of different lengths against each other, suggesting that while simpler heuristics are somewhat general, the more complex seem to overfit their training set.

    Original languageEnglish (US)
    Title of host publicationGECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference
    PublisherAssociation for Computing Machinery, Inc
    Pages181-188
    Number of pages8
    ISBN (Electronic)9781450356183
    DOIs
    StatePublished - Jul 2 2018
    Event2018 Genetic and Evolutionary Computation Conference, GECCO 2018 - Kyoto, Japan
    Duration: Jul 15 2018Jul 19 2018

    Publication series

    NameGECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference

    Other

    Other2018 Genetic and Evolutionary Computation Conference, GECCO 2018
    CountryJapan
    CityKyoto
    Period7/15/187/19/18

    Keywords

    • Empirical study
    • Games
    • Genetic programming

    ASJC Scopus subject areas

    • Computer Science Applications
    • Software
    • Computational Theory and Mathematics

    Fingerprint Dive into the research topics of 'Generating beginner heuristics for simple Texas hold'em'. Together they form a unique fingerprint.

  • Cite this

    De Mesentier Silva, F., Lantz, F., Togelius, J., & Nealen, A. (2018). Generating beginner heuristics for simple Texas hold'em. In GECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference (pp. 181-188). (GECCO 2018 - Proceedings of the 2018 Genetic and Evolutionary Computation Conference). Association for Computing Machinery, Inc. https://doi.org/10.1145/3205455.3205601