23 ms·
Why is the python implementation so much more complicated than the doom one? Are they supposed to be the same?
by dmak 11y ago
Why is the python implementation so much more complicated than the doom one? Are they supposed to be the same?
- JoachimS 11y agoSeriously? The DOOM prng is just a table with a pointer stepping through the values. The Perlin code generates values based on the Perlin algorithm. The values in the DOOM table could have been generated by Carmack throwing a dice many times for all we know and just tabulated the results.
- ghayes 11y agoTo be fair, the key insight to the DOOM prng is that it was used frequently enough for hundreds of mundane events that a player didn't realize (or care) that it wasn't very random at all. There was never a "guess the number" game. A good write-up is here: http://jmtd.net/log/deterministic_doom/ http://jmtd.net/log/deterministic_doom/
- JoachimS 11y agoYes, that is totally correct. But that does not make the question why the DOOM solution is so much smaller than the perlin noise code more valid. It is simply not the same thing. One is a table of set of generated data, the other a generator of data that can be tabulated.