I have some problem with my homework.


1 1 1 1 1 1 1 1 1
1 0 1 1 0 1 1 0 1
1 0 0 0 0 0 0 0 1
1 0 1 1 1 1 1 0 1
1 0 0 0 0 0 0 0 1
1 0 1 0 1 0 1 0 1
1 0 1 0 1 0 1 0 1
1 0 1 0 1 0 1 0 0
1 X 1 0 1 0 1 0 1
1 1 1 1 1 1 1 1 1

Our mascot in the maze wants to be rescued. It finds the way randomly and when our mascot is on the dead-end street, it can’t get rid of there; therefore, you must help it by pushing “enter” button and supply to go back as a step.

Read the maze area from a *.txt file and don’t use “Enigma” extension.
Write each action with a message step by step. For Example:

on (8,1)
on (7,1)
on (6,1)
on (5,1)
on (4,1)
it prefers to go right
on (4,2)
on (4,3)
it prefers to go down
on (5,3)
on (6,3)
on (7,3)
on (8,3)
help me by pushing “enter” button until I say “enough”, please :(
on (7,3)
on (6,3)
on (5,3)
on (4,3)
enough, thanks :)

I make with stack class and matrix. But I don't know reading file in java. And what do I write in text file?