Procedural Content Generation for Games: A Survey

被引:247
作者
Hendrikx, Mark [1 ]
Meijer, Sebastiaan [1 ]
van der Velden, Joeri [1 ]
Iosup, Alexandru [1 ]
机构
[1] Delft Univ Technol, NL-2628 CD Delft, Netherlands
关键词
Theory; Design; Standardization; Algorithms; Game content generation; procedural; survey; ONLINE GAMES;
D O I
10.1145/2422956.2422957
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hundreds of millions of people play computer games every day. For them, game content-from 3D objects to abstract puzzles-plays a major entertainment role. Manual labor has so far ensured that the quality and quantity of game content matched the demands of the playing community, but is facing new scalability challenges due to the exponential growth over the last decade of both the gamer population and the production costs. Procedural Content Generation for Games (PCG-G) may address these challenges by automating, or aiding in, game content generation. PCG-G is difficult, since the generator has to create the content, satisfy constraints imposed by the artist, and return interesting instances for gamers. Despite a large body of research focusing on PCG-G, particularly over the past decade, ours is the first comprehensive survey of the field of PCG-G. We first introduce a comprehensive, six-layered taxonomy of game content: bits, space, systems, scenarios, design, and derived. Second, we survey the methods used across the whole field of PCG-G from a large research body. Third, we map PCG-G methods to game content layers; it turns out that many of the methods used to generate game content from one layer can be used to generate content from another. We also survey the use of methods in practice, that is, in commercial or prototype games. Fourth and last, we discuss several directions for future research in PCG-G, which we believe deserve close attention in the near future.
引用
收藏
页数:22
相关论文
共 138 条
[1]  
ADAMS D., 2002, THESIS U SHEFFIELD U
[2]  
Alexander C., 1977, A pattern language: towns, buildings, construction
[3]   Wooden Geometric Puzzles: Design and Hardness Proofs [J].
Alt, Helmut ;
Bodlaender, Hans ;
van Kreveld, Marc ;
Rote, Guenter ;
Tel, Gerard .
THEORY OF COMPUTING SYSTEMS, 2009, 44 (02) :160-174
[4]  
[Anonymous], 2003, NAT COMP SER
[5]  
[Anonymous], 1994, Nonlinear dynamics and chaos: with applications to physics, biology, chemistry, and engineering, DOI 9780738204536
[6]  
[Anonymous], 2010, Proceedings of the 2010 Workshop on Procedural Content Generation in Games-PCGames, DOI DOI 10.1145/1814256.1814257
[7]  
[Anonymous], 1998, Cellular Automata Modeling of Physical Systems
[8]  
[Anonymous], Proceedings of the 4th International Conference on Foundations of Digital Games. FDG'09. 2009, DOI DOI 10.1145/1536513.1536532
[9]  
[Anonymous], 2010, P AAAI C ARTIFICIAL
[10]  
Ashlock Daniel, 2010, 2010 IEEE Information Theory Workshop (ITW 2010), P289, DOI 10.1109/ITW.2010.5593341