PMARINA / ExitPerfectMaze Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Assignment for Algo -- Make a maze solver (can be based on the maze generator)

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
115.png		115.png
Maze.java		Maze.java
README.md		README.md
StdDraw.java		StdDraw.java
output.png		output.png

Repository files navigation

Undirected Graphs - Getting out of the Maze

Given an N-by-N maze (like the one created in the previous exercise), write a program to find a path from the start cell (1, 1) to the finish cell (N, N), if it exists. To find a solution to the maze, run the following algorithm, starting from (1, 1) and stopping if we reach cell (N, N).