// The object of this program is to find the largest contiguous
// set of cells in a blob.  We assume that the input will be similar
// to that of the maze program -- a 2-D array of 0's and 1's.
// Depending on the practical application, we may want to change
// the solution to apply to 3-D, or to allow diagonals to be counted,
// or to be sensitive to the depth of the cells.
// And it would be simple to add a loop here that finds the biggest
// blob.
import java.io.*;

public class Driver
{
  public static void main(String [] args) throws IOException
  {
    Puzzle p = new Puzzle();
    int cells = p.solve(0, 3);
    System.out.println("I found " + cells);
  }
}