Controllable procedural map generation via multiobjective evolution
Open accessThe DOI matches its Crossref record; 36 of the 37 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“A survey revealed that the prevailing opinion among highly experienced players is that only symmetric levels can actually be balanced [18].”
From Simulation-Driven Balancing of Competitive Game Levels With Reinforcement Learning (2024) · cites this paper as [18]
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053 · cited 4×
“We employ the NSGA-II standard recombination/mutation operators simulated binary crossover (SBX) and polynomial mutation (PM) from [28] with (near) default parameter values of gc = 20 and gm = 15 3.”
BackgroundMethodInfluentialFlow: the psychology of optimal experience
(1990) · Choice Reviews Online · doi:10.5860/choice.28-0597 · Cited by 12,637
Flow: The Psychology of Optimal Experience
Buchanan, R., & Csikszentmihalyi, M. (1991) · Design Issues · doi:10.2307/1511458 · Cited by 9,394
Probable Inference, the Law of Succession, and Statistical Inference
Wilson, E. B. (1927) · Journal of the American Statistical Association · doi:10.1080/01621459.1927.10502953 · Cited by 4,476 · cited 2×
“The null hypothesis is that all measured proportions (one for each map) 4 The complete thread can be found at http://www.teamliquid.net/forum/viewmessage.php?topic_id= 245185¤tpage=All 5 The manual is available e.g. here: http://stat.ethz.ch/R-manual/R-patched/library/stats/html/prop.test. html, the test goes ba…”
MethodSimulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
SMS-EMOA: Multiobjective selection based on dominated hypervolume
Beume, N., Naujoks, B., & Emmerich, M. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.008 · Cited by 2,048 · cited 2×
“The SMS-EMOA, which we use in this paper, generates only one new individual per cycle and removes the individual with the smallest hypervolume contribution, i.e. the one that dominates the smallest part of the objective space.”
BackgroundSelf-citationDas, I., & Dennis, J. E. (1997) · Structural Optimization · doi:10.1007/bf01197559 · Cited by 1,208
A Theory of Fun for Game Design
Koster, R., & Wright, W. (2004) · Cited by 1,110
Search-Based Procedural Content Generation: A Taxonomy and Survey
Togelius, J., Yannakakis, G. N., Stanley, K. O., & Browne, C. (2011) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2011.2148116 · Cited by 706 · cited 3×
“On the continuum of direct-indirect representations presented in [8], our representation would be at level one or two from the top (the ‘‘direct’’ end of the scale).”
BackgroundInfluentialSelf-citationTowards automatic personalised content creation for racing games
Togelius, J., De Nardi, R., & Lucas, S. M. (2007) · 2007 IEEE Symposium on Computational Intelligence and Games · doi:10.1109/cig.2007.368106 · Cited by 283
Self-citation
Research works printed but not linked: 1
- T.W. Malone, What makes computer games fun? Byte 6, 258–277 (1981)
Cited by
Increasing generality in machine learning through procedural content generation
Risi, S., & Togelius, J. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0208-z · Cited by 122
“Standard search-based # # # # # # [18, 19, 20, 21, 22]”
MethodSelf-citationConstrained Novelty Search: A Study on Game Content Generation
Liapis, A., Yannakakis, G. N., & Togelius, J. (2014) · Evolutionary Computation · doi:10.1162/evco_a_00123 · Cited by 82
“…a fitness function pertaining to its entertainment value (Yannakakis and Togelius, 2011), its learnability (Browne and Maire, 2010), its visual appeal (Liapis et al., 2012), its appropriateness to a specific user (Shaker et al., 2010) or multiple gameplay objectives (Togelius et al., 2013).”
BackgroundSelf-citationWorldSmith: Iterative and Expressive Prompting for World Building with a Generative AI
Dang, H., Brudy, F., Fitzmaurice, G., & Anderson, F. (2023) · Proceedings of the 36th Annual ACM Symposium on User Interface Software and Technology · doi:10.1145/3586183.3606772 · Cited by 47
“To relieve users from designing on the micro-level, many domain-specific tools have been developed, such as procedural terrain generation tools [3, 52, 58], which algorith-mically generate varied terrains based on a fixed set of rules or grammar [59, 71].”
MethodDemonstrating the Feasibility of Automatic Game Balancing
Volz, V., Rudolph, G., & Naujoks, B. (2016) · Proceedings of the Genetic and Evolutionary Computation Conference 2016 · doi:10.1145/2908812.2908913 · Cited by 51
“with regards to playability [18], solvability [17], or diversity [15, 10].”
BackgroundSearching for good and diverse game levels
Preuß, M., Liapis, A., & Togelius, J. (2014) · IEEE Conference on Computational Intelligence and Games (CIG) · doi:10.1109/cig.2014.6932908 · Cited by 48
“In previous work we have investigated the various qualities of maps that can be measured specifically for strategy games, and explored the use of multiobjective evolution to balance the conflicts between these metrics [2].”
BackgroundSelf-citation
Metadata
- Authors
- Togelius, J., Preuss, M., Beume, N., Wessing, S., Hagelbäck, J., Yannakakis, G. N., & Grappiolo, C.
- Affiliations
- IT University of Copenhagen (DK)
- TU Dortmund University (DE)
- Blekinge Institute of Technology (SE)
- Corresponding author
- Preuss, Mike
- Venue
- Genetic Programming and Evolvable Machines
- Published
- 2013-03-16
- Volume
- 14
- Issue
- 2
- Pages
- 245-277
- ISSN
- 1389-2576 (ISSN-L)
- 1573-7632
- OpenAlex
- W2092735940
- Cited by
- 48
- References
- 37
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 4 · 2023: 2 · 2022: 3 · 2021: 1 · 2020: 7 · 2019: 2 · 2018: 3 · 2017: 5 · 2016: 9 · 2015: 1 · 2014: 9
- FWCI
- 6.55
- Type
- journal article
- Language
- en
- Open access
- green
- www.um.edu.mt
- Licence
- other-oa
- www.springer.com/tdm (tdm)
- Locations
- Genetic Programming and Evolvable Machines (publishedVersion)
- OAR@UM (University of Malta) (submittedVersion, other-oa)
- Diva portal (Dalarna University Library) (submittedVersion, other-oa)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
- Social Sciences › Sociology and Political Science › Digital Games and Media
- Keywords
- procedural map generation, multi-objective evolutionary algorithms, real-time strategy games, StarCraft, height maps
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Controllable procedural map generation via multiobjective evolution. https://app.cochat.ai/papers/10.1007/s10710-012-9174-5
- The paper
- Togelius, J., Preuss, M., Beume, N., Wessing, S., Hagelbäck, J., Yannakakis, G. N., & Grappiolo, C. (2013). Controllable procedural map generation via multiobjective evolution. Genetic Programming and Evolvable Machines. https://doi.org/10.1007/s10710-012-9174-5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.