private int findNeighborsAndMissingBombs(Point numberPos, List<Point> neighbors) {
        int missingBombs = map[numberPos.x][numberPos.y];
        for(int k=numberPos.x-1; k<=numberPos.x+1; k++)
            for(int l=numberPos.y-1; l<=numberPos.y+1; l++)
                if( k>=0 && l>=0 && k<8 && l<9 )
                    if( probabilities[k][l]==-1 )
                        neighbors.add( new Point(k,l) );
                    else if( probabilities[k][l]==1 )
                        --missingBombs;
        return missingBombs;
    }