1 1 1 1 1 1 1 1 1 1
1 1 0 0 0 1 0 T 0 1
S 0 0 1 1 1 0 1 1 1
1 1 0 0 0 0 0 0 0 1
1 1 1 1 1 1 1 1 1 1
Could you please help me solve this exercise ?
Need some help how to implement "Wall follower" Algorithm in order to find a path to the treasure.
I have to build a programme in C that reads a matrix with 0 and 1, asks the user to give START and TREASURE coordinates and finds a path to the treasure.
"1" means you cannot pass through that value, "0" means you can pass through that value.
Looking forward to get an answer from you. Thanx in advance.