I think the RNG source is the point here. It's not as impossible as stated, but you have to put some work in to get a good one.
Also, I'm keen to see what shuffle algorithms you know of that aren't susceptible to RNG issues
2. Nobody in this thread is criticizing Fisher-Yates, because in all likelihood all of us are using Fisher-Yates. We're discussing the failure of the algorithm used in the article.
3. Please take the time to read and understand the posts you respond to before you respond to them.
The following algorithm is not susceptible to RNG issues (in Rust, since I've been playing around with it):
fn shuffle(vec: &Vec) -> () {
}
That would certainly be a good thing to check before using Go's shuffle for real-money poker games. I wouldn't take it for granted.
> Also, I'm keen to see what shuffle algorithms you know of that aren't susceptible to RNG issues
There are not and cannot be any such algorithms. That's the entire point of this thread. Fisher-Yates is necessary but not sufficient. You either have sufficient random bits for your shuffle or not.