This quick Gist shows how to use the fast non-cryptographic hash function MurmurHash to generate a single purely deterministic random numbers based off a of specific seed. I'm borrowing the perezd/node-murmurhash
NPM port.
The idea is to deterministically recreate the same set of numbers from a small number of seeds with algorithms that internally use these seeds (in any order, note) by modifying them with constant but unique salts of their own. MurmurHash is fast enough for use in games (for me).
The other half of this Gist contains a standard form (because the custom bound and mode is pointless with a simple general-purpose map function, and the curvature cannot be varied anyway) of the "Gaussianesque" Raised Cosine Distribution, which is conveniently finite and enough for my example use. It maps uniform random numbers generated by the MurmurHash prng to the