Maze Adventurer

• 

  Sample Input

• 

  Sample Output

Inspiration

The project explores the use of Breadth First Search and Depth First Search in solving mazes.

What it does

The program takes as input a maze. At the end of the maze, there is a secret value (could be a number or a character or a (non-space) word). the program then outputs how many steps the adventurer took to reach the end of the maze using Breadth First Search and Depth First Search. The program also outputs the secret value the adventurer finds at the end of his journey.

How I built it

The program uses a 2D array of "cells" to repersent the maze. The "cell" is a class created for this project

Challenges I ran into

Loading the file into a 2D array took some time, but I was able to figure it out.

Accomplishments that I am proud of

The program works! I am glad that the program is able to compare the number of steps taken for BFS and DFS by the adventures to reach the end of the maze.

What I learned

I learned a lot about class design in this project

What's next for Maze Adventurer

Currently, the decisions taken by DFS are arbitrary. When there is a fork in the path, the DFS algorithm chooses and arbitrary path to explore. I am planning on writing a Greedy DFS algorithm that improves the efficiency of DFS

Built With

• java