Generating Novice Heuristics for Post-Flop Poker

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

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

    Abstract

    Agents now exist that can play Texas Hold'em Poker at a very high level, and simplified versions of the game have been solved. However, this does not directly translate to learning heuristics humans can use to play the game. We address the problem of learning chains of human-learnable heuristics for playing heads-up limit Texas Hold'em, focusing on the post-flop stages of the game. By restricting the policy space to fast and frugal trees, which are sequences of if-then-else rules, we can learn such heuristics using several methods including genetic programming. This work builds on our previous work on learning such heuristic rule set for Blackjack and pre-flop Texas Hold'em, but introduces a richer language for heuristics.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018
    PublisherIEEE Computer Society
    Volume2018-August
    ISBN (Electronic)9781538643594
    DOIs
    StatePublished - Oct 11 2018
    Event14th IEEE Conference on Computational Intelligence and Games, CIG 2018 - Maastricht, Netherlands
    Duration: Aug 14 2018Aug 17 2018

    Other

    Other14th IEEE Conference on Computational Intelligence and Games, CIG 2018
    CountryNetherlands
    CityMaastricht
    Period8/14/188/17/18

    Fingerprint

    Genetic programming

    Keywords

    • Beginner heuristics
    • Genetic algorithms
    • Poker

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Computer Graphics and Computer-Aided Design
    • Computer Vision and Pattern Recognition
    • Human-Computer Interaction
    • Software

    Cite this

    De Mesentier Silva, F., Togelius, J., Lantz, F., & Nealen, A. (2018). Generating Novice Heuristics for Post-Flop Poker. In Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018 (Vol. 2018-August). [8490415] IEEE Computer Society. https://doi.org/10.1109/CIG.2018.8490415

    Generating Novice Heuristics for Post-Flop Poker. / De Mesentier Silva, Fernando; Togelius, Julian; Lantz, Frank; Nealen, Andy.

    Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018. Vol. 2018-August IEEE Computer Society, 2018. 8490415.

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

    De Mesentier Silva, F, Togelius, J, Lantz, F & Nealen, A 2018, Generating Novice Heuristics for Post-Flop Poker. in Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018. vol. 2018-August, 8490415, IEEE Computer Society, 14th IEEE Conference on Computational Intelligence and Games, CIG 2018, Maastricht, Netherlands, 8/14/18. https://doi.org/10.1109/CIG.2018.8490415
    De Mesentier Silva F, Togelius J, Lantz F, Nealen A. Generating Novice Heuristics for Post-Flop Poker. In Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018. Vol. 2018-August. IEEE Computer Society. 2018. 8490415 https://doi.org/10.1109/CIG.2018.8490415
    De Mesentier Silva, Fernando ; Togelius, Julian ; Lantz, Frank ; Nealen, Andy. / Generating Novice Heuristics for Post-Flop Poker. Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018. Vol. 2018-August IEEE Computer Society, 2018.
    @inproceedings{6125489d84dc4e4fb3383152cc47709f,
    title = "Generating Novice Heuristics for Post-Flop Poker",
    abstract = "Agents now exist that can play Texas Hold'em Poker at a very high level, and simplified versions of the game have been solved. However, this does not directly translate to learning heuristics humans can use to play the game. We address the problem of learning chains of human-learnable heuristics for playing heads-up limit Texas Hold'em, focusing on the post-flop stages of the game. By restricting the policy space to fast and frugal trees, which are sequences of if-then-else rules, we can learn such heuristics using several methods including genetic programming. This work builds on our previous work on learning such heuristic rule set for Blackjack and pre-flop Texas Hold'em, but introduces a richer language for heuristics.",
    keywords = "Beginner heuristics, Genetic algorithms, Poker",
    author = "{De Mesentier Silva}, Fernando and Julian Togelius and Frank Lantz and Andy Nealen",
    year = "2018",
    month = "10",
    day = "11",
    doi = "10.1109/CIG.2018.8490415",
    language = "English (US)",
    volume = "2018-August",
    booktitle = "Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018",
    publisher = "IEEE Computer Society",

    }

    TY - GEN

    T1 - Generating Novice Heuristics for Post-Flop Poker

    AU - De Mesentier Silva, Fernando

    AU - Togelius, Julian

    AU - Lantz, Frank

    AU - Nealen, Andy

    PY - 2018/10/11

    Y1 - 2018/10/11

    N2 - Agents now exist that can play Texas Hold'em Poker at a very high level, and simplified versions of the game have been solved. However, this does not directly translate to learning heuristics humans can use to play the game. We address the problem of learning chains of human-learnable heuristics for playing heads-up limit Texas Hold'em, focusing on the post-flop stages of the game. By restricting the policy space to fast and frugal trees, which are sequences of if-then-else rules, we can learn such heuristics using several methods including genetic programming. This work builds on our previous work on learning such heuristic rule set for Blackjack and pre-flop Texas Hold'em, but introduces a richer language for heuristics.

    AB - Agents now exist that can play Texas Hold'em Poker at a very high level, and simplified versions of the game have been solved. However, this does not directly translate to learning heuristics humans can use to play the game. We address the problem of learning chains of human-learnable heuristics for playing heads-up limit Texas Hold'em, focusing on the post-flop stages of the game. By restricting the policy space to fast and frugal trees, which are sequences of if-then-else rules, we can learn such heuristics using several methods including genetic programming. This work builds on our previous work on learning such heuristic rule set for Blackjack and pre-flop Texas Hold'em, but introduces a richer language for heuristics.

    KW - Beginner heuristics

    KW - Genetic algorithms

    KW - Poker

    UR - http://www.scopus.com/inward/record.url?scp=85055531746&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85055531746&partnerID=8YFLogxK

    U2 - 10.1109/CIG.2018.8490415

    DO - 10.1109/CIG.2018.8490415

    M3 - Conference contribution

    VL - 2018-August

    BT - Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018

    PB - IEEE Computer Society

    ER -