Carleton University - School of Computer Science Honours Project
Fall 2018
Procedural Generation of World Maps for 2D Platforming Games
SCS Honours Project Image
ABSTRACT
The problem was to help solve the issue some games have with replayability, namely 2D platforming games. One way to do this is to design an algorithm that takes a set of rooms and produces a procedurally generated map that can be used in a 2D platforming game. With restrictions on how rooms can be combined. Multiple approaches were taken to solve this problem including researching possible strategies used in existing games in the genre and strategies from other procedural generation algorithms used to accomplish other tasks. A game was produced that could test the outputted maps by having players traverse a large percentage of the rooms that make up each map. Testers were used to play the game and provide feedback on the viability of the algorithm. The finished design of the algorithm uses a 2D array to store information and generate basic maps, and then multiple pass throughs are made to add in special rooms that have rules on when and how they can be added in. From accomplishing this it can be shown that procedural generation does indeed add replayability to 2D platforming games.