Err... sorry, misspoke about bug# 1009821. I still think this is the same, but the relevant code creates a list of 100 lists of random lengths 1 to 20. Then, it goes through and finds the longest list in the maximize cases and the shortest list in the minimize cases. If that list of lists gets regenerated, there is no guarantee that it will come up with the same answer.
We should eliminate the randomness or seed it in these or at least fix the eval oddness.
Err... sorry, misspoke about bug# 1009821. I still think this is the same, but the relevant code creates a list of 100 lists of random lengths 1 to 20. Then, it goes through and finds the longest list in the maximize cases and the shortest list in the minimize cases. If that list of lists gets regenerated, there is no guarantee that it will come up with the same answer.
We should eliminate the randomness or seed it in these or at least fix the eval oddness.