Generating Real-Time Strategy Heightmaps using Cellular Automata
Article No.: 14, Pages 1 - 4
Abstract
This paper presents a new approach of heightmap generation for Real-Time Strategy games (RTS) based on Cellular Automata (CA) in the context of various established techniques. The proposed approach uses different CA rulesets to generate and modify maps for the RTS game Supreme Commander. To evaluate the quality of the generated maps, a survey was conducted asking 30 participants about map quality compared to user-generated maps. The participants rated the maps more balanced and novel but less aesthetically pleasing. The paper concludes with according future work propositions to improve the presented approach.
References
[1]
Daniel Ashlock and Cameron McGuinness. 2013. Landscape automata for search based procedural content generation. In IEEE Conference on Computational Inteligence in Games (CIG). IEEE, Niagara Falls, ON, Canada, 1–8.
[2]
Arthur W Burks and John Von Neumann. 1966. Theory of self-reproducing automata.
[3]
Min Cao, Guo’an Tang, Fang Zhang, and Jianyi Yang. 2013. A cellular automata model for simulating the evolution of positive–negative terrains in a small loess watershed. International Journal of Geographical Information Science 27, 7(2013), 1349–1363.
[4]
Jonas Freiknecht and Wolfgang Effelsberg. 2017. A Survey on the Procedural Generation of Virtual Worlds. Multimodal Technologies and Interaction 1, 4 (2017). https://doi.org/10.3390/mti1040027
[5]
Lawrence Johnson, Georgios N Yannakakis, and Julian Togelius. 2010. Cellular automata for real-time generation of infinite cave levels. In Proceedings of the 2010 Workshop on Procedural Content Generation in Games. ACM, 1–4.
[6]
Martin Kahoun. 2013. Realtime library for procedural generation and rendering of terrains. Diploma Thesis. Univerzita Karlova.
[7]
Tobias Mahlmann, Julian Togelius, and Georgios N Yannakakis. 2012. Spicing up map generation. In European Conference on the Applications of Evolutionary Computation. Springer Berlin Heidelberg, Malaga, Spain, 224–233.
[8]
Ivo Marak. 1996. Random midpoint displacement method. http://old.cescg.org/CESCG97/marak/node3.html. Accessed: 2019-11-13.
[9]
Ken Perlin. 1985. An Image Synthesizer. SIGGRAPH Comput. Graph. 19, 3 (July 1985), 287–296. https://doi.org/10.1145/325165.325247
[10]
Ken Perlin. 2001. Noise hardware. Real-Time Shading SIGGRAPH Course Notes.
[11]
Swapnil Sinvhal. 2007. Mapping textures on 3D Terrains: A hybrid cellular automata approach. Ph.D. Dissertation. Texas A&M University.
[12]
Patricio Gonzalez Vivo and Jen Lowe. Last Accessed: 2019-11-21. Chapter Noise in The Book of Shaders. https://thebookofshaders.com/11/.
[13]
H. Wang, W. Chen, X. Liu, and B. Dong. 2010. An improving algorithm for generating real sense terrain and parameter analysis based on fractal. In 2010 International Conference on Machine Learning and Cybernetics, Vol. 2. IEEE, 686–691. https://doi.org/10.1109/ICMLC.2010.5580560
- Generating Real-Time Strategy Heightmaps using Cellular Automata
Recommendations
Cellular automata between sofic tree shifts
We study the sofic tree shifts of A^@S^^^@?, where @S^@? is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if X@?A^@S^^^@? is a sofic tree shift, then the ...
Cellular automata on regular rooted trees
CIAA'12: Proceedings of the 17th international conference on Implementation and Application of AutomataWe study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.
State-Efficient One-Bit Communication Solutions for Some Classical Cellular Automata Problems
Special issue on DLT'04We present several state-efficient implementations on 1-bit inter-cell communication cellular automata for some classical cellular automata problems. The 1-bit inter-cell communication cellular automaton model (CA$_{1-bit}$) studied in this paper is a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
September 2020
804 pages
ISBN:9781450388078
DOI:10.1145/3402942
Copyright © 2020 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 September 2020
Check for updates
Author Tags
Qualifiers
- Short-paper
- Research
- Refereed limited
Conference
FDG '20
FDG '20: International Conference on the Foundations of Digital Games
September 15 - 18, 2020
Bugibba, Malta
Acceptance Rates
Overall Acceptance Rate 152 of 415 submissions, 37%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 136Total Downloads
- Downloads (Last 12 months)22
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format