CECS 274 Project 2 
Recursion

There is a 10x10 board with approximately one-third of the square blocked 
with a 'b' and the others blank. Determine whether there is a path from the 
lower-left square to any square on the upper-row.

Choose the blocked squares randomly using the Random class and the nextInt 
method discussed in Chapter 6. The board could be a double array (discussed in 
Chapter 7) of char. You could have a constructor with no arguments that sets 
the board and a method to get the board. The recursive method would try to find
a path. Its parameters are the coordinates of the starting square. When that 
square is occupied there is no path. Otherwise it recusively tries to find a 
path from its neighbors above, left, right, and down (but only if these 
sqaures are blank and still on the board). If that square is occupied there is 
no path. When at the top row it only has to check if the square is 
blocked. Either way the recursion ends. 

There can be situations where one can repeat left-right-left-right ... 
indefinitely. To avoid this mark each square you test with an x and do not 
return to any marked square.

In your test program write a static method to display the board or add a 
toString instance method to the class you use for the board instance. It 
has no parameters and returns String. Then if your borad instance is 
called myBoard you can display it with System.out.println(myBoard) which 
cals the toString method automatically.  Display the board, the result of the 
test for a path, and the board after the test (which will show the x-marked 
squares too). Do several repeats. 

Post the code and tests on Beachboard.