public boolean findpath(int row, int collumn) {
		//in this method recursing over all possible directions after a given square
		boolean done = false;
		if (valid(row, collumn)) {
			grid[row][collumn] = 9; //visited
			if (row == endrow && collumn == endcol)
				done = true;
			else {
				done = (findpath(row, collumn+1));
				if (!done)
					done = findpath(row+1, collumn);
				if (!done)
					done = findpath(row, collumn - 1);
				if (!done)
					done = findpath(row - 1, collumn);
			}
			if (done)
				grid[row][collumn] = 7;
		}
		return done;
	}