Skip to main content

Evolving Diverse Cellular Automata Based Level Maps

  • Conference paper
  • First Online:
Proceedings of 6th International Conference in Software Engineering for Defence Applications (SEDA 2018)

Abstract

This chapter generalizes a technique for creating terrain maps using a generative fashion based cellular automata representation. The original technique, using fashion based cellular automata, generated terrain maps that exhibit a consistent texture throughout. The generalization presented here co-evolves rules to permit a spatially varying type of map. Pairs of fashion based cellular automata rules are evaluated with objective functions that require connectivity within the terrain and encourage other qualities such as entropic diversity of terrain type, separation of the rule types, and a specified fraction of clear terrain pixels. These three encouraged properties are independently switchable yielding eight different possible fitness functions which are tested and compared. Use of the entropic diversity reward is found to strongly encourage good results while rewarding separation of the two rules without the entropic diversity reward was found to yield bad results with an excess of empty space. The matrix encoding of cellular automata rules yields a discrete granular space encoded with real parameters. Some properties of this space are provided.

The authors would like to thank the University of Guelph for its support of this work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
EUR 29.95
Price includes VAT (Hong Kong/P.R.China)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 117.69
Price includes VAT (Hong Kong/P.R.China)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 149.99
Price excludes VAT (Hong Kong/P.R.China)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ashlock D (2006) Evolutionary computation for opimization and modeling. Springer, New York

    MATH  Google Scholar 

  2. Ashlock D (2018) Exporing representation in evolutionary level design. Morgan and Claypool, San Rafel

    Google Scholar 

  3. Togelius J, Yannakakis G, Stanley K, Browne C (2010) Search-based procedural content generation. In: Applications of evolutionary computation. Lecture notes in computer science, vol 6024. Springer, Heidelberg, pp 141–150

    Google Scholar 

  4. Sorenson N, Pasquier P (2010) Towards a generic framework for automated video game level creation. In: Proceedings of the European conference on applications of evolutionary computation (EvoApplications). LNCS, vol 6024. Springer, pp 130–139

    Google Scholar 

  5. Togelius J, Preuss M, Yannakakis GN (2010) Towards multiobjective procedural map generation. In: Proceedings of the 2010 workshop on procedural content generation in games, PCGames 2010. ACM, New York, pp 1–8

    Google Scholar 

  6. Johnson L, Yannakakis GN, Togelius J (2010) Cellular automata for real-time generation of infinite cave levels. In: Proceedings of the 2010 workshop on procedural content generation in games, PCGames 2010. ACM, New York

    Google Scholar 

  7. Ashlock D, Lee C, McGuinness C (2011) Search-based procedural generation of maze-like levels. IEEE Trans Comput Intell AI Games 3(3):260–273

    Article  Google Scholar 

  8. Ashlock D, Lee C, McGuinness C (2011) Simultaneous dual level creation for games. Comput Intell Mag 2(6):26–37

    Article  Google Scholar 

  9. Ashlock D, McNicholas S (2013) Fitness landscapes of evolved cellular automata. IEEE Trans Evol Comput 17(2):198–212

    Article  Google Scholar 

  10. Ashlock D (2015) Evolvable fashion based cellular automata for generating cavern systems. In: Proceedings of the 2015 IEEE conference on computational intelligence in games. IEEE Press, Piscataway, pp 306–313

    Google Scholar 

  11. Ashlock D, Bickley L (2016) Rescalable, replayable maps generated with evolved cellular automata. Acta Phys Pol (B) Proc Suppl 9(1):13–24

    Article  Google Scholar 

  12. Darwin C (1859) On the origin of species by means of natural selection. Murray, London

    Google Scholar 

  13. Wolfram S (1984) Universality and complexity in cellular automata. Phys D: Nonlinear Phenom 10(1–2):1–35

    Article  MathSciNet  Google Scholar 

  14. Sapin E, Bailleux O, Chabrier J (1997) Research of complexity in cellular automata through evolutionary algorithms. Complex Syst 11:1

    MATH  Google Scholar 

  15. Ashlock D, McGuinness C (2016) Graph-based search for game design. Game Puzzle Des 2(2):68–75

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel Ashlock .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ashlock, D., Kreitzer, M. (2020). Evolving Diverse Cellular Automata Based Level Maps. In: Ciancarini, P., Mazzara, M., Messina, A., Sillitti, A., Succi, G. (eds) Proceedings of 6th International Conference in Software Engineering for Defence Applications. SEDA 2018. Advances in Intelligent Systems and Computing, vol 925. Springer, Cham. https://doi.org/10.1007/978-3-030-14687-0_2

Download citation

Publish with us

Policies and ethics