Solving a random maze recursively
<p>I'm trying to solve a randomly generated maze in Java using recursion.  What makes my situation different from others on this site is that I'm using bitwise operations to move through the maze rather than cells in a grid. When an area is clicked on the maze, my program should display a red path to the end.  I cannot find out how to mark my tracks on a path in order to backtrack.</p>

<p>I'm using a method searchMaze(int row, int col, byte d) in order to move through the maze in my Main class:
<a href="http://pastie.org/3515632" rel="nofollow">http://pastie.org/3515632</a></p>

<p>Here are the other sources I'm using for maze generation/path handling:
<a href="http://pastie.org/3515624" rel="nofollow">http://pastie.org/3515624</a>
http://pastie.org/3515627</p>

<p>How could I go about incorporating a backtracking function into my code?</p>
