Automated playtesting of matching tile games

Luvneesh Mugrai, Fernando Silva, Christoffer Holmgard, Julian Togelius

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

    Abstract

    Matching tile games are an extremely popular game genre. Arguably the most popular iteration, Match-3 games, are simple to understand puzzle games, making them great benchmarks for research. In this paper, we propose developing different procedural personas for Match-3 games in order to approximate different human playstyles to create an automated playtesting system. The procedural personas are realized through evolving the utility function for the Monte Carlo Tree Search agent. We compare the performance and results of the evolution agents with the standard Vanilla Monte Carlo Tree Search implementation as well as to a random move-selection agent. We then observe the impacts on both the game's design and the game design process. Lastly, a user study is performed to compare the agents to human play traces.

    Original languageEnglish (US)
    Title of host publicationIEEE Conference on Games 2019, CoG 2019
    PublisherIEEE Computer Society
    ISBN (Electronic)9781728118840
    DOIs
    StatePublished - Aug 2019
    Event2019 IEEE Conference on Games, CoG 2019 - London, United Kingdom
    Duration: Aug 20 2019Aug 23 2019

    Publication series

    NameIEEE Conference on Computatonal Intelligence and Games, CIG
    Volume2019-August
    ISSN (Print)2325-4270
    ISSN (Electronic)2325-4289

    Conference

    Conference2019 IEEE Conference on Games, CoG 2019
    CountryUnited Kingdom
    CityLondon
    Period8/20/198/23/19

    Fingerprint

    Tile

    Keywords

    • Genetic Evolution
    • Match-3
    • Monte Carlo Tree Search
    • Procedural Personas

    ASJC Scopus subject areas

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

    Cite this

    Mugrai, L., Silva, F., Holmgard, C., & Togelius, J. (2019). Automated playtesting of matching tile games. In IEEE Conference on Games 2019, CoG 2019 [8848057] (IEEE Conference on Computatonal Intelligence and Games, CIG; Vol. 2019-August). IEEE Computer Society. https://doi.org/10.1109/CIG.2019.8848057

    Automated playtesting of matching tile games. / Mugrai, Luvneesh; Silva, Fernando; Holmgard, Christoffer; Togelius, Julian.

    IEEE Conference on Games 2019, CoG 2019. IEEE Computer Society, 2019. 8848057 (IEEE Conference on Computatonal Intelligence and Games, CIG; Vol. 2019-August).

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

    Mugrai, L, Silva, F, Holmgard, C & Togelius, J 2019, Automated playtesting of matching tile games. in IEEE Conference on Games 2019, CoG 2019., 8848057, IEEE Conference on Computatonal Intelligence and Games, CIG, vol. 2019-August, IEEE Computer Society, 2019 IEEE Conference on Games, CoG 2019, London, United Kingdom, 8/20/19. https://doi.org/10.1109/CIG.2019.8848057
    Mugrai L, Silva F, Holmgard C, Togelius J. Automated playtesting of matching tile games. In IEEE Conference on Games 2019, CoG 2019. IEEE Computer Society. 2019. 8848057. (IEEE Conference on Computatonal Intelligence and Games, CIG). https://doi.org/10.1109/CIG.2019.8848057
    Mugrai, Luvneesh ; Silva, Fernando ; Holmgard, Christoffer ; Togelius, Julian. / Automated playtesting of matching tile games. IEEE Conference on Games 2019, CoG 2019. IEEE Computer Society, 2019. (IEEE Conference on Computatonal Intelligence and Games, CIG).
    @inproceedings{566ec1fb002541d0b562003fbccaa35c,
    title = "Automated playtesting of matching tile games",
    abstract = "Matching tile games are an extremely popular game genre. Arguably the most popular iteration, Match-3 games, are simple to understand puzzle games, making them great benchmarks for research. In this paper, we propose developing different procedural personas for Match-3 games in order to approximate different human playstyles to create an automated playtesting system. The procedural personas are realized through evolving the utility function for the Monte Carlo Tree Search agent. We compare the performance and results of the evolution agents with the standard Vanilla Monte Carlo Tree Search implementation as well as to a random move-selection agent. We then observe the impacts on both the game's design and the game design process. Lastly, a user study is performed to compare the agents to human play traces.",
    keywords = "Genetic Evolution, Match-3, Monte Carlo Tree Search, Procedural Personas",
    author = "Luvneesh Mugrai and Fernando Silva and Christoffer Holmgard and Julian Togelius",
    year = "2019",
    month = "8",
    doi = "10.1109/CIG.2019.8848057",
    language = "English (US)",
    series = "IEEE Conference on Computatonal Intelligence and Games, CIG",
    publisher = "IEEE Computer Society",
    booktitle = "IEEE Conference on Games 2019, CoG 2019",

    }

    TY - GEN

    T1 - Automated playtesting of matching tile games

    AU - Mugrai, Luvneesh

    AU - Silva, Fernando

    AU - Holmgard, Christoffer

    AU - Togelius, Julian

    PY - 2019/8

    Y1 - 2019/8

    N2 - Matching tile games are an extremely popular game genre. Arguably the most popular iteration, Match-3 games, are simple to understand puzzle games, making them great benchmarks for research. In this paper, we propose developing different procedural personas for Match-3 games in order to approximate different human playstyles to create an automated playtesting system. The procedural personas are realized through evolving the utility function for the Monte Carlo Tree Search agent. We compare the performance and results of the evolution agents with the standard Vanilla Monte Carlo Tree Search implementation as well as to a random move-selection agent. We then observe the impacts on both the game's design and the game design process. Lastly, a user study is performed to compare the agents to human play traces.

    AB - Matching tile games are an extremely popular game genre. Arguably the most popular iteration, Match-3 games, are simple to understand puzzle games, making them great benchmarks for research. In this paper, we propose developing different procedural personas for Match-3 games in order to approximate different human playstyles to create an automated playtesting system. The procedural personas are realized through evolving the utility function for the Monte Carlo Tree Search agent. We compare the performance and results of the evolution agents with the standard Vanilla Monte Carlo Tree Search implementation as well as to a random move-selection agent. We then observe the impacts on both the game's design and the game design process. Lastly, a user study is performed to compare the agents to human play traces.

    KW - Genetic Evolution

    KW - Match-3

    KW - Monte Carlo Tree Search

    KW - Procedural Personas

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

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

    U2 - 10.1109/CIG.2019.8848057

    DO - 10.1109/CIG.2019.8848057

    M3 - Conference contribution

    AN - SCOPUS:85073102111

    T3 - IEEE Conference on Computatonal Intelligence and Games, CIG

    BT - IEEE Conference on Games 2019, CoG 2019

    PB - IEEE Computer Society

    ER -