Date of Award

Spring 5-2015

Degree Type

Honors College Thesis

Department

Computing

First Advisor

Bikramjit Banerjee

Advisor Department

Computing

Abstract

This thesis is about using Artificial Intelligence in regards to Procedural Content Generation to help try and avoid a deadlock scenario in a hypothetical dungeon exploring game. The deadlock scenario is essentially having a key being placed in a room that’s inaccessible to the player. An example of such a scenario would be if the key to room A being in Room B, the key to room B was in room A, and the player was in room C. The program generates the dungeon world with a random number of rooms inside it, each room also having a random number of generated sub-rooms or no sub-rooms at all, and then will place the rooms’ respective keys somewhere in the world, so long as whatever arrangement occurs in the end will allow the player to explore the entire dungeon world if they desire or need to. The entire program was written in Java, and the dungeon world’s rooms are arranged into a tree data structure to represent each room’s relationship to one another.

Share

COinS