Automated playtesting of matching tile games

Luvneesh Mugrai, Fernando Silva, Christoffer Holmgard, Julian Togelius

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


    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
    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
    ISSN (Print)2325-4270
    ISSN (Electronic)2325-4289


    Conference2019 IEEE Conference on Games, CoG 2019
    Country/TerritoryUnited Kingdom


    • 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


    Dive into the research topics of 'Automated playtesting of matching tile games'. Together they form a unique fingerprint.

    Cite this