This is an academic project for an artificial intelligence course
The purpose of this project is to find the path between the start and the end, which is done using the dfs algorithm
The program reads a txt file as the maze environment, which contains the following components:
| Symbol | Meaning |
|---|---|
| % | Wall / Obstacles |
| - | Open way |
| S | Start node |
| G | Finish node |
Also, two numbers are given as the number of rows and columns of the maze environment in the first line. example: 15,12
The output of the program is a sequence of movements in four directions like: R,R,R,U,U,R,R,D,L,U