When building / University of Washington / University of Washington Center / University of California / /
IndustryTerm
search process / declarative 3D modeling tool / spaced reference solutions / combinatorial search infrastructure / mission generation systems / simplest solution / search spaces / evolutionary algorithm / online and offline analysis / difficult combinatorial search problems / software engineering practices / reference solutions / above algorithm / search algorithms3 / long shortest-path solutions / heuristic search algorithm / search algorithm / software systems / similar spatial search / search problems / search algorithms / certain sub-networks / legitimate best-effort research solution / generation systems / generate-and-test systems / genetic algorithm / ms. search / approachable solution / hand-rolled search / depth-first search / difficult search problems / simpler solutions / genetic algorithms / related systems / online game / candidate solution / live search process / combinatorial search / puzzle solution / online educational game / non-search activities / hand-rolled complete-search implementation / particular network / partial solutions / randomized depth-first search / level design automation tools / diverse level design automation tools / search space / highperformance combinatorial search algorithm / feasible solutions / Search-based procedural content generation / constrained search problem / level design automation systems / /
Organization
University of Washington / National Science Foundation / Cambridge Univ. / University of Washington Center for Game Science / Center for Games and Playable Media / Melinda Gates Foundation / University of California / Santa Cruz Center for Game Science / /
Person
Adam M. Smith / Michael Mateas / Erik Andersen / /
Position
given player / General / player / designer / Feed-Forward / programmer / /
A Case Study of Expressively Constrainable Level Design Automation Tools for a Puzzle Game Adam M. Smith∗† , Erik Andersen† , Michael Mateas∗ , Zoran Popovi´c† ∗ †