/*
 * This class will use recursion to solve a maze. 
 */
class MazeSolver
{
  /* This is the constructor. Given a properly constructed Maze,
     It should set things up for the solve() method, &c to do 
     the "real world"
   */
  public MazeSolver(Maze maze)
  {
    // Insert your code here (and delete this comment)
  }

  /* This is a wrapper for the recursive solve method. It should do
     very little -- really just call that with the right paramters.
     It basically exists to hide the complex paramterization from
     the users.
   */
  public boolean solve()
  {
    // Insert your code here (and delete this comment)
  }

  /*
   * This is the "meat and potatoes". This method shoudl use recursion
   * to solve the maze. It should return "true" if the maze has a solution
   * and "false" otherwise. It should also set up the data structure
   * so that toString() can produce the path that was used from start to
   * finish
   *
   * "current" is the current position in the maze -- this is initally
   * start. "previous" is the cell that we came from -- this is used to
   * stop us from going back there. 
   */
   
  private boolean solve_recursive(Maze.Cell current, Maze.Cell previous)
  {
    // Insert your code here (and delete this comment)
  }

  // This should convert the maze and the path through the maze to a String.
  public String toString()
  {
    // Insert your code here (and delete this comment)
  }

  // This should be your test driver
  public static void main(String args[]) throws Exception
  {
    // Insert your code here (and delete this comment)
  }

}