Help on a Recursive Maze

Question

Java Maze is already a recursive program. (I think-if not please let me know if my program is not recusive.) It prints a 3 wherever it moves and wherever it is possible to have that spot as part of the exit path for the Maze. It prints a 7 if the spot is part of the final pathway to the exit. The program supposedly stores the value of the spots it encounters and then backtracks to find the exit strategy. I need help with the following addition:
Modify the maze class so that it prints out the
path of the final solution as it is discovered, without
storing it. If you can help me know what i need to change that would be good too.
Here is the code I have for now with the runner first and the Maze class second. Thanks in advance.
public class MazeSearch
   //  Creates a new maze, prints its original form, tries to
   //  solve it, and prints out its final form.
   public static void main (String[] args)
      Maze labyrinth = new Maze();
      System.out.println (labyrinth);
      if (labyrinth.traverse (0, 0))
         System.out.println ("The maze was successfully solved!");
      else
         System.out.println ("There is no possible path.");
      System.out.println (labyrinth);
public class Maze
   private final int TRIED = 3;
   private final int PATH = 7;
   private int[][] grid = { {1,1,1,0,1,1,0,0,0,1,1,1,1},
                            {1,0,1,1,1,0,1,1,1,1,0,0,1},
                            {0,0,0,0,1,0,1,0,1,0,1,0,0},
                            {1,1,1,0,1,1,1,0,1,0,1,1,1},
                            {1,0,1,0,0,0,0,1,1,1,0,0,1},
                            {1,0,1,1,1,1,1,1,0,1,1,1,1},
                            {1,0,0,0,0,0,0,0,0,0,0,0,0},
                            {1,1,1,1,1,1,1,1,1,1,1,1,1} };
   //  Tries to recursively follow the maze. Inserts special
   //  characters for locations that have been tried and that
   //  eventually become part of the solution.
   public boolean traverse (int row, int column)
      boolean done = false;
      if (valid (row, column))
         grid[row][column] = TRIED;  // this cell has been tried
         if (row == grid.length-1 && column == grid[0].length-1)
            done = true;  // the maze is solved
         else
            done = traverse (row+1, column);     // down
            if (!done)
               done = traverse (row, column+1);  // right
            if (!done)
               done = traverse (row-1, column);  // up
            if (!done)
               done = traverse (row, column-1);  // left
         if (done)  // this location is part of the final path
            grid[row][column] = PATH;
      return done;
   //  Determines if a specific location is valid.
   private boolean valid (int row, int column)
      boolean result = false;
      // check if cell is in the bounds of the matrix
      if (row >= 0 && row < grid.length &&
          column >= 0 && column < grid[row].length)
         //  check if cell is not blocked and not previously tried
         if (grid[row][column] == 1)
            result = true;
      return result;
   //  Returns the maze as a string.
   public String toString ()
      String result = "\n";
      for (int row=0; row < grid.length; row++)
         for (int column=0; column < grid[row].length; column++)
            result += grid[row][column] + "";
         result += "\n";
      return result;
}

Answer 1

Well okay you've posted this a second time in the same forum...
http://forum.java.sun.com/thread.jspa?threadID=5263177&tstart=0
Now go ahead and explain in your own words what it is you think you are supposed to do.