Here are some hints for doing the 1st honors project:

1. Start by using the static maze from the "program that prints a maze"
link. It's the same one as was randomly generated in the last diagram in the
assignment. Once you have gotten the program to work, substitute a randomly
generated maze.

2. The maze method should be recursive and contain no for-loops or while-loops.
I started from the NW and recursively called the method in a clockwize
direction, i.e., NW, N, NE, E, SE, S, SW, W, by changing the values of the
row and column.

3. The recursion should stop when the column number equals 10 and the value of
the cell is a blank. You should be careful to avoid a wall, i.e., " |".

4. The value of the counter should be converted to a string and stored right
justified in the cell, e.g., "12" and " 3".

By the way, the copareTo() method works alphabetically, so that "120"
is less than "99". This is because "120" would appear before  "99" in
a phone book or dictionary.