jpettigrew: I'm assuming this is for Strader's 202?
What you need to do is set up a recursive function, say called findNortheastPath().
Inside the recursive function, you'll need a base case, which would need to basically check to see if the current location (x,y) you are checking is the same as the ending location, if it is return true. If this is not true, the function would need to recursively call the same function twice, but with different starting locations:
1. For going north (x-1, y)
2. For going east (x, y+1)
You can provide output in the recursive function to print out the coordinates as you follow the paths to the ending location.
I know this is vague, but I hope this helps.