public boolean inARow (Grid g, int n, char p) {
        boolean result = false;
        for (int i=0; i<=g.size-1; i++) {
           for (int j=0; j<=g.size-1; j++) {
              // look vertically down
              result = true;
              for (int k=0; k<n; k++)
                { if (!g.equals(i+k, j, p))
                    result = false; }
              if (result) return true;
              // look horizontally to the right
              result = true;
              for (int k=0; k<n; k++)
                { if (!g.equals(i, j+k, p))
                    result = false; }
              if (result) return true;              
              // look diagonally down
              result = true;
              for (int k=0; k<n; k++)
                { if (!g.equals(i+k, j+k, p))
                    result = false; }
              if (result) return true;              
              // look diagonally up
              result = true;
              for (int k=0; k<n; k++)
                { if (!g.equals(i-k, j+k, p))
                    result = false; }
              if (result) return true;
           }
        }
        return result;
    }