Implemented Fisher–Yates shuffle.

 Assumes RNG function is in form rng->getNumber(min,max), with min and max inclusive (Did not find documentation on function). If it is not, there will be an off by one error in implementation. Current shuffling algorithm appears to be a naive implementation. It also requires a temporary vector to hold the deck. This implementation uses QList::swap instead.