MCMCTS PCG 4 SMB: Monte Carlo Tree Search to Guide Platformer Level Generation
-
Published:2021-06-24
Issue:3
Volume:11
Page:68-74
-
ISSN:2334-0924
-
Container-title:Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment
-
language:
-
Short-container-title:AIIDE
Author:
Summerville Adam,Philip Shweta,Mateas Michael
Abstract
Markov chains are an enticing option for machine learned generation of platformer levels, but offer poor control for designers and are likely to produce unplayable levels. In this paper we present a method for guiding Markov chain generation using Monte Carlo Tree Search that we call Markov Chain Monte Carlo Tree Search (MCMCTS). We demonstrate an example use for this technique by creating levels trained on a corpus of levels from Super Mario Bros. We then present a player modeling study that was run with the hopes of using the data to better inform the generation of levels in future work.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献