Programming Forums - Maze solver w/ stacks.

I have to make a maze solver using stacks. We can't use the stacks that come with java, and have to use this:

import java.util.ArrayList;
 
public class iStack implements stackInterface
{
        private ArrayList <location> data;//stores object
        private int top;//top of stack
        private int size;//number of objects in stack
 
 
        public iStack()
        {
                data = new ArrayList();
                top = -1;
                size = 0;
        }
 
        public boolean isEmpty()//return true if stack is empty
        {
                return top == -1;
        }
 
        public void push(Object x)//puts an object into the stack
        {
                data.add(x);
                top++;
                size++;
        }
 
        public Object pop()//removes top object from stack
        {
                int temp = top;
                top--;
                size--;return data.remove(temp);
        }
 
        public Object peekTop()//returns top of stack but doesn't delete 
        {
                return data.get(top);
        }
 
        public int getSize()//returns number of objects in stack
        {
                return size;
        }
}

I also made a location class that we have to use

public class location
{
        private int row;
        private int col;
 
        public location()
        {
                row = 0;
                col = 0;
        }//location
 
        public location(int r, int c)
        {
                row = r;
                col = c;
        }
 
        public int getRow()
        { 
                return row;
        }//getrow
        public int getCol()
        { 
                return col; 
        }//getcol
 
 
        public String toString()
        {        
                return("(row, col) = ("+ row + ", " + col + ").");
        }//toString
 
        public int compareTo(Object obj)
        {
                location loc =(location)obj;
                if (this.row != loc.getRow() || 
                        this.col != loc.getCol())
                        return -1;
                else
                        return 0;
        }//compareTo
}//location

The part where I am pretty much stuck at is on how to change the board. The main objective here is to have a maze and let the program solve it. It should keep track of its path and record its data and finish the maze. The maze is a 2-d array.

        int maze[][] = {{0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0},
                                        {0,0,0,0,0,1,0,1,1,1,1,1,1,1,1,0,1,0,0,0},
                                        {0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,1,1},
                                        {0,1,0,0,0,1,0,1,1,1,1,0,0,1,0,0,1,0,0,0},
                                        {0,1,0,0,0,1,0,1,1,1,1,0,0,1,0,0,1,0,0,0},
                                        {0,1,0,0,0,1,0,0,1,0,1,0,0,1,0,0,0,0,0,0},
                                        {0,0,0,0,0,0,0,0,1,0,1,0,0,1,0,0,0,0,0,0},
                                        {1,1,1,1,1,0,0,0,1,0,1,0,0,1,0,0,1,1,1,1},
                                        {0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,1,1,1,1},
                                        {0,1,1,1,1,1,1,0,0,0,1,0,0,1,0,0,0,0,0,0}};

The 0's translates to the paths available and 1's are walls. The stack class above is to be used to get across the maze. I don't want anyone to do it for me, but any guidance would be really appreciated. I'm just really confused on where to start here.