private boolean hasANeighbour(int i, int j) {

		this.forest[i][j] = -1;

		boolean result = true;
		if (isValid(i, j - 1) && this.forest[i][j - 1] == 1) {
			return hasANeighbour(i, j - 1);
		} else if (isValid(i - 1, j) && this.forest[i - 1][j] == 1) {
			return hasANeighbour(i - 1, j);
		} else if (isValid(i, j + 1) && this.forest[i][j + 1] == 1) {
			return hasANeighbour(i, j + 1);
		} else if (isValid(i + 1, j) && this.forest[i + 1][j] == 1) {
			return hasANeighbour(i + 1, j);
		} else
			result = false;

		return result;
	}