|
|
|
|
|
by SeanLuke
4316 days ago
|
|
> Backward compatibility in a RNG is actually rather important, weirdly enough. For example, anything that uses deterministic seeds for repeatability of procedural generation or optimization. (Read: Minecraft, among other more important things). This seems like a very, very bad thing to rely on. Other than Java, how many other languages have guarantees in generator determinism from version to version as part of the language contract? Certainly Lisp considers it an antipattern. |
|
I mean, if manually seeding the PRNG doesn't produce a deterministic result, you wouldn't make it part of the API.