Maze Pathfinding and Generation

Final Assessment for Algorithm Course at Saxion

Feature:

• Generate Dungeons based on Rooms and Connected Corridors
• Render Tiles over Generated Rooms
• Have Morc Travel through 2 points using specified Algorithms
• Pathfinding Algorithm: Recursive DFS, Breadth First, Dijkstra and Astar

Controls

Pathfinding Algorithm

U → Skip through 1000 steps (configurable) when generating path

O → Fast-forward generation

P → Pause the Pathfinding Algorithm

I → Step 1 step of the Pathfinding Algorithm

Movement

Ctrl → Speed up Morc’s Movement

Left Click → Set Destination of Morc

Right Click → Teleport Morc to node

Installation

Requires .NET Framework 4.0 and Visual Studio

Simply Open assignment/Algorithm.sln and Run and Build the application

License

MIT