Non-Euclidean Maze Video Game

While in college, I wanted to test my skills in Web Development and applications of graph theory. As a result, I used HTML, CSS, and Javascript to create a non-euclidean maze game. The basic principle of this game is that the player has to learn how the rooms are connected while looking for the end of the maze. A new maze is randomly generated every time, and rooms are attached with various doors, but the non-eucliean nature of the maze comes from the fact that, for example, taking the West door may lead you from Room 3 to Room 10, but taking the East door once you are in Room 10 might not lead back to Room 3.

Under the hood, a directed graph with a maximum number of edges moving outward (to represent the 4 directions you can move in the game) represents a maze that seemingly has no rhyme or reason, but remains consistent as you scour for the final room.