Abstract
Procedural Content Generation (PCG) aims to automatically generate the content of games using algorithmic approaches, as this can reduce the cost of game design and development. PCG algorithms can be applied to all elements of a game, including terrain, maps, stories, dialogues, quests, and characters. A wide variety of search algorithms can be applied to PCG problems; however, those most often used are variations of evolutionary algorithms. This study focuses on comparing three metaheuristic approaches applied to racetrack games, with the specific goal of evaluating the effectiveness of different algorithms in producing game content. To that end, a Genetic Algorithm (GA), Artificial Bee Colony (ABC), and Particle Swarm Optimization (PSO) are applied to a game-level design task to attempt to identify any discernible differences in their performance and identify whether alternative algorithms offer desirable performance characteristics. The results of the study indicate that both the ABC and PSO approaches offer potential advantages to Genetic Algorithm implementation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: International Journal of Applied Metaheuristic Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
