filmov
tv
Math for Game Programmers Noise Based RNG

Показать описание
Speaker(s): Squirrel Eiserloh
Company Name(s): SMU Guildhall
Track / Format: Programming
Overview: Random generation is all the rage, and the C++ language finally offers something better than rand(). However, even Mersenne Twister lacks many highly desirable features. This session will discuss RNGs vs. noise functions, and show how the latter can replace the former in your math library and provide many other benefits (unordered access, better reseeding, record/playback, network loss tolerance, lock-free parallelization, etc.) while being smaller, faster, and easier to use.
Company Name(s): SMU Guildhall
Track / Format: Programming
Overview: Random generation is all the rage, and the C++ language finally offers something better than rand(). However, even Mersenne Twister lacks many highly desirable features. This session will discuss RNGs vs. noise functions, and show how the latter can replace the former in your math library and provide many other benefits (unordered access, better reseeding, record/playback, network loss tolerance, lock-free parallelization, etc.) while being smaller, faster, and easier to use.