Search-based procedural generation of maze-like levels

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 3, Issue 3, 2011, Pages 260-273

  Ashlock, Daniel ^a   Lee, Colin ^a   McGuinness, Cameron ^a  

^a UNIVERSITY OF GUELPH   (Canada)

Author keywords

Dynamic programming; evolutionary computation; intelligence and AI in Games; search based procedural content generation

Indexed keywords

DESIGN SPACES; DYNAMIC PROGRAMMING ALGORITHM; EVOLUTIONARY COMPUTATIONS; EVOLVABLE; FITNESS FUNCTION DESIGNS; FITNESS FUNCTIONS; INTELLIGENCE AND AI IN GAMES; MULTIPLE REPRESENTATION; PATH LENGTH; SEARCH-BASED; VARIATION OPERATOR;

GENES; HEALTH;

DYNAMIC PROGRAMMING;

EID: 80052903124     PISSN: 1943068X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCIAIG.2011.2138707     Document Type: Conference Paper

References (22)

1. B. Albertson, Chess Mazes: A New Kind of Puzzle for Everyone. South Chatham, MD: ChessCafe.com, 2004.
2. B. Albertson, ChessMazes 2. South Chatham, MD: ChessCafe.com, 2008.
3. D.Ashlock, "Automatic generation of game elements via evolution," in Proc. 2010 IEEE Conf. Comput. Intell. Games (CIG '10), Copenhagen, Denmark, 2010, pp. 289-296, IEEE Press.
4. D. Ashlock, K. M. Bryden, and S. P. Gent, "Evolutionary control of bracked L-system interpretation," in Proc. Intell. Eng. Syst. Through Artif. Neural Netw., St. Louis, MO, 2004, vol. 14, pp. 271-276.
5. D. Ashlock, K. M. Bryden, and S. P. Gent, "Creating spatially constrained virtual plants using L-systems," in Smart Engineering System Design: Neural Networks, Evolutionary Programming, and Artificial Life. New York: ASME Press, 2005, pp. 185-192.
6. D. Ashlock, T. Manikas, and K. Ashenayi, "Evolving a diverse collection of robot path planning problems," in Proc. 2006 Congress Evol. Comput., Vancouver, BC, Canada, 2006, pp. 6728-6735.
7. D. A. Ashlock, S. P. Gent, and K. M. Bryden, "Evolution of L-systems for compact virtual landscape generation," in Proc. 2005 Congress Evol. Comput., Edinburgh, U.K., 2005, vol. 3, pp. 2760-2767. (Pubitemid 41496192)
8. W. Ashlock, "Using very small population sizes in genetic programming," in Proc. 2006 Congress Evol. Comput.,Vancouver, BC, Canada, 2006, pp. 319-326. (Pubitemid 47130514)
9. W. Ashlock and D. Ashlock, "Single parent genetic programming," in Proc. 2005 Congress Evol. Comput., Edinburgh, U.K., 2005, vol. 2, pp. 1172-1179, IEEE Press. (Pubitemid 41495984)
10. R. Bellman, Dynamic Programming. Princeton, NJ: Princeton University Press, 1957.
11. L. Johnson, G. N. Yannakakis, and J. Togelius, "Cellular automata for real-time generation of infinite cave levels," in PCGames '10: Proc. 2010 Workshop Procedural Content Generation Game., New York, USA, 2010, ACM.
12. D. E. Knuth, The Art of Computer Programming Volume 2: Seminumerical Algorithms. New York: Addison-Wesley, 1997.
13. A. Lindenmayer, "Mathematical models for cellular interaction in development, parts i and ii," Journal of Theoretical Biology, vol. 16, pp. 280-315, 1968.
14. S. B. Needleman and C. D. Wunsch, "A general method applicable to the search for similarities in the amino acid sequence of two proteins," J. Molecular Biol., vol. 3, no. 48, pp. 443-53, 1970.
15. Y. I. H. Parish and P. Müller, "Procedural modeling of cities," in Proc. 28th Annu. Conf. Comput. Graphics Interact. Techniques (SIGGRAPH '01), New York, 2001, pp. 301-308, ACM. (Pubitemid 33047315)
16. P. Prusinkiewicz, A. Lindenmayer, and J. S. Hanan, The Algorithmic Beauty of Plants. New York: Springer-Verlag, 1990.
17. F. Rothlauf, "Representations for evolutionary algorithms," in Proc. 2008 GECCO Conf. Companion Genet. Evol. Comput. (GECCO '08:), New York, USA, 2008, pp. 2613-2638, ACM.
18. N. Sorenson and P. Pasquier, "Towards a generic framework for automated video game level creation," in Proc. Eur. Conf. Appl. Evol. Comput. (EvoApplications), Istanbul, Turkey, 2010, vol. 6024, pp. 130-139, Springer LNCS.
19. G. Syswerda, "A study of reproduction in generational and steady state genetic algorithms," in Proc. Foundations Genet. Algorithms, Bloomington, IN, 1991, pp. 94-101.
20. J. Togelius, M. Preuss, and G. N. Yannakakis, "Towards multiobjective procedural map generation," in Proc. 2010 Workshop Procedural Content Generation Games (PCGames '10), New York, USA, 2010, pp. 1-8, ACM.
21. J. Togelius, G. Yannakakis, K. Stanley, and C. Browne, "Search-based procedural content generation," in Proc. Appl. Evol. Comput., 2010, vol. 6024, Lecture Notes Comp. Sci., pp. 141-150, Springer Berlin/Heidelberg.
22. A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inf. Theory, vol. 13, no. 2, Feb. 1967.