Recursive Maze

I don't know if anybody here can help but this problem is making me go insane. Here's what I have to do:

Write a recursive program that finds ALL LEGAL PATHS whose cost is <= to X(command line argument). Read from a file, output good points of the maze into a file, etc. Here is a sample maze file

3 3 <~~~~ 3 x 3 maze
0 1 1
0 0 0
1 0 0

0's are paths, 1's are walls. As you can see that maze has 2 correct paths. I can get my program to find one good path, but not all paths. I also can't figure out how to tell if it hits a wall or the edge of the maze. Any help would be appreciated, once I'm done with this I have to do an iterative maze solver, doesn't that sound like fun too?