Prob!
Consider the problem of a trapped mouse that tries to find its way to a destination in a maze. The mouse hopes to reach there from the stating point by systematically trying all the routes. If it reaches a dead end, it retraces its steps to the last position and begins at least one more untried path. For each position, the mouse can go in one of the four directions: left, right, down, up. help the mouse to find a way out recursively. You have to show the complete path followed by the mouse to reach to the required position.The maze consists of 0s(empty) and 1s(obstacles).
The input file is in the following format:
Line 1: two numbers separated by space indicates the size (rows and columns respectively) of the maze
Line 2: two numbers separated by space indicates the position of mouse in the maze in row and column format.
Line 3: two numbers separated by space indicates the destination of mouse in the maze in row and column
format.
Line 4: On the next line the maze started.
The input file is in the following format:
Line 1: two numbers separated by space indicates the size (rows and columns respectively) of the maze
Line 2: two numbers separated by space indicates the position of mouse in the maze in row and column format.
Line 3: two numbers separated by space indicates the destination of mouse in the maze in row and column
format.
Line 4: On the next line the maze started.
Topic archived. No new replies allowed.