Pick one of the following problems to do for your interclass problem.

1. Longest Path - Modify code written in class so that it will tell you the length of the longest, non-self-intersecting path to the end.

2. Number of Paths - Modify code written in class so that it will tell you how many non-self-intersecting paths there are to the end.

3. Can't Get There - The code we wrote for doing shortest path has a problem if there isn't a path to the exit. Fix it so that the mouse doesn't move if it can't get where it is going.

4. Animating Recursion - Pick any recursive method other than shortest path or towers of Hanoi and animate it so that you can see what it is doing.