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).
-
Notifications
You must be signed in to change notification settings - Fork 0
PMARINA/ExitPerfectMaze
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Assignment for Algo -- Make a maze solver (can be based on the maze generator)
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published