Automatic content generation is the production of content for games, web pages, or other purposes by procedural means. Search-based automatic content generation employs search-based algorithms to accomplish automatic content generation. This book presents a number of different techniques for search-based automatic content generation where the search algorithm is an evolutionary algorithm. The chapters treat puzzle design, the creation of small maps or mazes, the use of L-systems and a generalization of L-system to create terrain maps, the use of cellular automata to create maps, and, finally, the decomposition of the design problem for large, complex maps culminating in the creation of a map for a fantasy game module with designersupplied content and tactical features.

The evolutionary algorithms used for the different types of content are generic and similar, with the exception of the novel sparse initialization technique are presented in Chapter 2. The points where the content generation systems vary are in the design of their fitness functions and in the way the space of objects being searched is represented. A large variety of different fitness functions are designed and explained, and similarly radically different representations are applied to the design of digital objects all of which are, essentially, maps for use in games.

Autorentext

Dr. Eun-Youn Kim is a mathematician with a background in graph theory and evolutionary game theory, having worked extensively on the issue of representation in the design of gameplaying agents. Dr. Kim received her Ph.D. in mathematics from Iowa State University. She has been employed at the National Institute of Mathematical Sciences and the Korea Institute of Bioscience and Biotechnology in Korea. Dr. Kims research interests include broad interests in evolutionary computation applied to game playing and network modeling in biological systems. She is a member of the IEEE Computational Intelligence Societies technical committee on games and has helped organize international games conferences. Dr. Kim is currently employed by the department of basic science in Hanbat National University in South Korea.Dr. Daniel Ashlock is a professor of mathematics at the University of Guelph in Ontario, Canada. Dr. Ashlock received his Ph.D. in mathematics from Caltech with a focus in algebraic combinatorics. He was employed at Iowa State University before moving to Canada. Dr. Ashlock works on representation issues in evolutionary computation including games, optimization, bioinformatics, and theoretical biology. He holds the Bioinformatics Chair in the Department of Mathematics and Statistics at Guelph and serves on the editorial board of the IEEE Transactions on Evolutionary Computation, the IEEE Transactions on Games, The IEEE/ACM Transactions on Bioinformatics and Computational Biology, Biosystems, and Game and Puzzle Design. Dr. Ashlock serves on the IEEE Computational Intelligence Societies technical committees on games and bioinformatics and biomedical engineering.

Inhalt
Preface.- Acknowledgments.- Introduction.- Contrasting Representations for Maze Generation.- Dual Mazes.- Terrain Maps.- Cellular Automata Based Maps.- Decomposition, Tiling, and Assembly.- Bibliography.- Author's Biography.