More specifically, there's mention of a simple yet effective shuffling algorithm called the Fisher-Yates algorithm that would have avoided the 'problem' had Microsoft implemented it instead of whatever method they did.
I'm always interested in simple yet powerful algorithms, so after reading up on how it's supposed to work here's my implementation in Python:
for i in range(len(items)):
j = randrange(len(items))
items[i], items[j] = items[j], items[i]
There's other implementations out there which I'm sure can be easily Googled. The simplicity of the algorithm really makes you wonder what Microsoft was thinking when they did it their way. Do they want to 'innovate' that badly?