Procedural Content Generation innebär att spelinnehåll genereras automatiskt för att dels minska arbetsbelastningen hos designers men också för att öka variationen i spel. Ett användningsområde för detta är rumsbaserad bangenerering där banor byggs upp av fördefinierade rum. Målet med det här arbetet var att implementera och jämföra tre olika algoritmer som kan åstadkomma detta; Binary Space Partitioning, Shortest path och en evolutionär algoritm. De kriterier som algoritmerna utvärderades på var tidseffektivitet, variation och möjligheten att nå alla rum. Resultatet visade att Binary Space Partitioning och Shortest path var de två algoritmer som var bäst lämpade att användas i ett spel där genereringen ska ske under körtiden.

When a videogame is being played it is rarely a static experience. A videogame can consist of various systems that affect each other in an unpredictable manner which makes the player experience unique for every player.Throughout the years developers of games have used random chance in a games programming to affect the user experience. Sometimes it even goes so far as to having entire games based around the idea of the game itself randomly generating content for a player to experience.This paper will examine randomly generated content in videogames. It will take examples from existing ones and describe how they use it, and reason regarding the benefits and drawbacks of having random chance affect the user experience.The paper will step-by-step examine the purpose of various commonly occurring objects and features of a typical Dungeon in an adventure videogame. It will reason around their purpose, and figure out ways to use them in a structured  manner so that we can guarantee that there will be no deadlocks that the player can't overcome.This will range from the environments in rooms, the shape of them, to the objects and creatures that inhabit them, such as locked doors, keys, and bosses.