public int moveRight(boolean findChange) {
        int total = 0;
        for (int y = 0; y < 4; y++) {
            for (int x = 0; x < 3; x++) {
                if (next.grid[x][y] != 0 && next.grid[x][y] == next.grid[x+1][y]) {
                    next.grid[x+1][y] *= 2;
                    next.grid[x][y] = 0;
                    total += weightingMerge(next.grid[x][y]);
                } else if (next.grid[x+1][y] == 0 && next.grid[x][y] > 0) {
                    next.grid[x+1][y] = next.grid[x][y];
                    next.grid[x][y] = 0;
                }

            }
        }
        if (findChange) return total + findChange();
        return total;
    }