Exploring Metaheuristic Algorithms for Enhanced Game Map Generation in Procedural Content Generation
This study examines the performance of genetic algorithms, the particle swarm optimization (PSO) algorithm, and the artificial bee colony (ABC) algorithm in procedural content generation for game map layouts. A series of experiments evaluated each algorithm's efficiency based on convergence speed, content quality, and overall map structure. The results showed that the genetic algorithms with tournament selection outperformed the PSO and the ABC algorithms in generating high-quality maps, though the PSO and the ABC algorithms demonstrated competitive performance in specific scenarios. This research highlights the importance of task-specific optimization, suggesting that hybrid approaches could improve game content generation by combining the strengths of different algorithms.
Authors
- Andy M. Connor (ORCID: https://orcid.org/0000-0002-4046-5959)
- Sana Alyaseri (ORCID: https://orcid.org/0009-0004-8650-0109)
- Roopak Sinha (ORCID: https://orcid.org/0000-0001-9486-7833)
Institutions
- Deakin University (AU)
- Auckland University of Technology (NZ)
- Whitecliffe College of Arts and Design (NZ)
Publication Details
- Journal
- International Journal of Applied Metaheuristic Computing
- Published
- 2025-09-25
- DOI
- https://doi.org/10.4018/ijamc.388932
- Primary Topic
- Artificial Intelligence in Games
- Type
- article
- Field-Weighted Citation Impact
- 0.00