DeepAI AI Chat
Log In Sign Up

Automated Playtesting of Matching Tile Games

by   Luvneesh Mugrai, et al.
NYU college

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.


A Fast Evolutionary adaptation for MCTS in Pommerman

Artificial Intelligence, when amalgamated with games makes the ideal str...

Analysis of Vanilla Rolling Horizon Evolution Parameters in General Video Game Playing

Monte Carlo Tree Search techniques have generally dominated General Vide...

Enhancing the Monte Carlo Tree Search Algorithm for Video Game Testing

In this paper, we study the effects of several Monte Carlo Tree Search (...

Which Heroes to Pick? Learning to Draft in MOBA Games with Neural Networks and Tree Search

Hero drafting is essential in MOBA game playing as it builds the team of...

Developing a Successful Bomberman Agent

In this paper, we study AI approaches to successfully play a 2-4 players...

MCTS-based Automated Negotiation Agent (Extended Abstract)

This paper introduces a new Negotiating Agent for automated negotiation ...

MCTS-based Automated Negotiation Agent

This paper introduces a new negotiating agent model for automated negoti...