Shuffler Question

While coding for “Build a Library” I was encouraged to go further and build an array shuffler. So I googled it and it seems like there is one agreed upon “best way” to code a shuffler in javascript (Fisher-Yates).

It got me wondering - it seems like at some point someone realized that the previously agreed upon best shuffler algorithm was wrong/bad/needed improvement, and so someone came around and fixed it. Does the coding community think we’ve hit on the best shuffler in Fisher Yates or could there be an even simpler way out there?