Search-based procedural content generation

Julian Togelius, Georgios N. Yannakakis, Kenneth O. Stanley, Cameron Browne

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Recently, a small number of papers have appeared in which the authors implement stochastic search algorithms, such as evolutionary computation, to generate game content, such as levels, rules and weapons. We propose a taxonomy of such approaches, centring on what sort of content is generated, how the content is represented, and how the quality of the content is evaluated. The relation between search-based and other types of procedural content generation is described, as are some of the main research challenges in this new field. The paper ends with some successful examples of this approach.

    Original languageEnglish (US)
    Title of host publicationApplications of Evolutionary Computation - EvoApplicatons 2010
    Subtitle of host publicationEvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, Proceedings
    PublisherSpringer Verlag
    Pages141-150
    Number of pages10
    EditionPART 1
    ISBN (Print)3642122388, 9783642122385
    DOIs
    StatePublished - 2010
    EventEvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, EvoApplicatons 2010 - Istanbul, Turkey
    Duration: Apr 7 2010Apr 9 2010

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    NumberPART 1
    Volume6024 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    OtherEvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, EvoApplicatons 2010
    CountryTurkey
    CityIstanbul
    Period4/7/104/9/10

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Search-based procedural content generation'. Together they form a unique fingerprint.

    Cite this