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

Foundations of Digital Games 2012, FDG 2012 - Conference Program

Volumn , Issue , 2012, Pages 156-163

  Smith, Adam M ^a,b   Andersen, Erik ^b   Mateas, Michael ^a   Popović, Zoran ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Answer set programming; Backtracking search; Educational games; Procedural content generation; Puzzle games

Indexed keywords

ANSWER SET PROGRAMMING; BACKTRACKING SEARCH; EDUCATIONAL GAME; PROCEDURAL CONTENT GENERATION; PUZZLE GAMES;

COMPUTER SOFTWARE; LEARNING SYSTEMS; LOGIC PROGRAMMING; REFRACTION;

COMPUTER AIDED DESIGN;

EID: 84863959571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2282338.2282370     Document Type: Conference Paper

References (17)

1. D. Ashlock. Automatic generation of game elements via evolution. In IEEE Symposium on Comp. Intel. and Games (CIG'10), pages 289-296, 2010.
2. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge Univ. Press, 2003.
3. S. Colton. Automated puzzle generation. In Proc. of the AISB'02 Symposium on AI and Creativity in the Arts and Sciences, 2002.
4. J. Dormans and S. Bakkes. Generating missions and spaces for adaptable play experiences. IEEE Trans. on Comp. Intel. and AI in Games, 3(3):216-228, 2011.
5. M. Gebser. gen-sudoku.gringo, 2010. http://asparagus.cs.uni-potsdam.de/ encoding/show/id/12739.
6. M. Gebser, B. Kaufmann, R. Kaminski, M. Ostrowski, T. Schaub, and M. T. Schneider. Potassco: The Potsdam answer set solving collection. AI Commun., 24(2):107-124, 2011.
7. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Conflict-driven answer set solving. In Proc. of the 20th Intl. Joint Conf. on Artif. Intel., pages 386-392, 2007.
8. C. P. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proc. of the 15th Natl. Conf. on Artif. Intel., pages 431-437, 1998.
9. S. O. Kimbrough, G. J. Koehler, M. Lu, and D. H. Wood. On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch. European Journal of Operational Research, 190(2):310-327, October 2008.
10. D. Oranchak. Evolutionary algorithm for generation of entertaining Shinro logic puzzles. In EvoApplications 2010, pages 181-190, 2010.
11. R. Smelik. A Declarative Approach to Procedural Generation of Virtual Worlds. PhD thesis, TU Delft, 2011.
12. A. Smith and M. Mateas. Answer set programming for procedural content generation: A design space approach. IEEE Trans. on Comp. Intel. and AI in Games, 3(3):187-200, 2011.
13. G. Smith, J. Whitehead, and M. Mateas. Tanagra: Reactive planning and constraint solving for mixed-initiative level design. IEEE Trans. on Comp. Intel. and AI in Games, 3(3):201-215, 2011.
14. P. Suaris and G. Kedem. An algorithm for quadrisection and its application to standard cell placement. IEEE Trans. on Circuits and Systems, 35(3):294-303, 1988.
15. J. Togelius, G. Yannakakis, K. Stanley, and C. Browne. Search-based procedural content generation: A taxonomy and survey. IEEE Trans. on Comp. Intel. and AI in Games, 3(3):172-186, 2011.
16. T. Tutenel, R. Bidarra, R. M. Smelik, and K. J. de Kreker. Rule-based layout solving and its application to procedural interior generation. In Proc. of the CASA Workshop on 3D Advanced Media in Gaming and Simulation, 2009.
17. X.-S. Yang. Nature-Inspired Metaheuristic Algorithms. Luniver Press, 2008.