Simultaneous Dual Level Creation for Games
- 11 April 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 6 (2) , 26-37
Abstract
Recent research has shown that it is possible to design fitness functions, based on dynamic programming, that allow evolutionary computation to automatically generate level maps for games. In this study levels with multiple types of barriers are automatically designed. The levels are designed under the assumption that there are two agent types and that at least one agent type may ignore one type of barrier. A specification of multiple types of barriers thus creates two mazes, one for each agent type, that coexist in the same space. The design of these dual mazes is accomplished using different fitness functions for two mazes simultaneously. For example, this permits a level with a single long winding path for an agent that cannot walk through one type of barrier coexisting with a low-diameter maze with more complex connectivity for an agent that cannot cross another type of barrier. This study explores two representations for game levels with multiple barrier types using four different pairs of fitness functions. The system is shown to be able to design dual mazes whose properties depend substantially on both the choice of fitness function and representation used.Keywords
This publication has 14 references indexed in Scilit:
- Automatic generation of game elements via evolution2010
- Towards multiobjective procedural map generation2010
- Search-Based Procedural Content Generation2010
- Towards a Generic Framework for Automated Video Game Level Creation2010
- A Multi-cellular Developmental Representation for Evolution of Adaptive Spiking Neural Microcircuits in an FPGA2009
- NeuroEvolution Based on Reusable and Hierarchical Modular RepresentationLecture Notes in Computer Science, 2009
- Direct and Indirect Representations for Evolutionary Design of Objects2008
- The impact of cellular representation on finite state agents for prisoner's dilemma2005
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967