This question is related, but mine is about a much more general case.
I want to roll $N$ dice $D_1, D_2, ..., D_{N}$. Each die $D_i$ has $K_i$ sides (so different dice possibly have different number of sides). Once I've rolled them, I want to keep the lowest value.
The sides of die $D_i$ are labeled $0, 1, ..., K_i-1$.
Example:
- There are 4 dice (with, respectively, 4 sides, 7 sides, 2 sides, 9 sides)
- I roll them, and get the values 2, 3, 1, 0
- 0 is the lowest values, so that's the final result of the experiment.
What is the expected value of the result? On average, what is my final result?
Let $X$ be the minimum of the $N$ rolls. It takes values in $0,1,\ldots, \min_i(K_i) - 1$.
$$E[X] = \sum_{m=1}^{\min_i(K_i) - 1} P(X \ge m) = P(X \ge 1) + P(X \ge 2) + \cdots + P(X \ge \min_i(K_i) - 1)$$
If you can compute each probability $P(X \ge m)$ you can get the expectation. Note that $$P(X \ge m) = P(\text{every dice roll is $\ge m$}) = P(\text{1st roll is $\ge m$}) P(\text{2nd roll is $\ge m$}) \cdots P(\text{$N$th roll is $\ge m$}).$$
The probability that the $i$th roll is $\ge m$ is $\frac{\max(K_i - m, 0)}{K_i}$.
In the end you get a pretty gnarly expression due to the generality of the $K_i$ possibly being all different.