Skip to main content
Article thumbnail
Location of Repository

A case study of expressively constrainable level design automation tools for a puzzle game

By Adam M. Smith, Erik Andersen, Michael Mateas and Zoran Popović

Abstract

Some problems in procedural content generation for games involve hard constraints (e.g. that a generated puzzle is necessarily solvable). Common techniques for generator design lack a way to specify crisp (yes/no) constraints on what counts as a valid content artifact and guarantee these constraints are satisfied in the generator’s output. In this paper we present two independent implementations of three diverse level design automation tools for the popular online educational game Refraction. All of the systems guarantee key properties of their output. Applying a constraint-focused generator design perspective in depth, we found that even emergent aesthetic style properties were straightforward to directly control. Our results with Refraction provide further concrete evidence for the claim that the expressive power of constraints and the ease with which they can be incorporated into suitably designed generative processes makes them a powerful tool for producing reliably-controllable generators for game content

Topics: set programming
Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.9308
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://homes.cs.washington.edu... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.