A very simple project based on DFS(Depth First Search).

In order to understand the program nicely,I want you to have a look at map.txt

In a maxtrix of numbers, 2 is the starting point,1 is the blocking number and 3 is the destination.

This program will try all four directions until it finds 0 to move forward or 3 to reach the destination. It works like backtracking.