Automated Playtesting of Matching Tile Games
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
BlenderGym: Benchmarking Foundational Model Systems for Graphics Editing
FREYR: A Framework for Recognizing and Executing Your Requests
Identifying and Clustering Counter Relationships of Team Compositions in PvP Games for Efficient Balance Analysis
Grammar-based Game Description Generation using Large Language Models
Word2World: Generating Stories and Worlds through Large Language Models
Learning Models of Adversarial Agent Behavior under Partial Observability
토론
이 논문과 연결된 포럼 글이 아직 없습니다.