That's about what I thought. One thing about the median that I personally don't like is if there's an equal amount of 2 movecounts (i.e. same amount of 7's as 9's) and you get a median movecount that doesn't exist. What would you want to do to fix the problems of median? Look at the pool of highest probability cases and see the median from there so it's more exact?
The most accurate way to go about it is to compute the expected value of the movecount. So basically, you want, for an algset of size N, expected movecount = sum(i = 1 to N) of p_i M_i, where M_i is the movecount of the ith case and p_i is the probability that it'll show up