It might be an interesting test discipline (typically of interest only in combination with :FORCE t) to allow people to run ASDF operations with random tie-breaking. This seems like a poor debugging technique, though, since the number of such orderings will explode in systems with weak RECORDED dependencies, so stumbling on a missing dependency might well not happen quickly....
i think that exponential blowup of the problem space is not so bad, because the load order issues also materialize in big subspaces of it.
but how about making then sorting the load order? (but then what about different lisps sorting unicode differently?)
i've learned to live with this, but i thought i bring this up here, maybe someone has some good idea that could go into ASDF2.