If you've created code that implements the recursive backtracker algorithm as outlined in the link given in the first post, and use it to build a maze starting from the entrance (green) cell, then once the "current cell" is the exit (red) cell, you'll find a solution is contained on the stack (in reverse order, i.e. the path from red to green).

With that in mind, very minor modifications to the existing code will enable it to solve any similar maze, such as the HugeMaze above, assuming that you can map the cells properly from a good picture of the maze that hasn't been mangled by jpeg compression and forum resizing.

Name:  hugemaze2_solved_ .png
Views: 3887
Size:  33.3 KB