Noise-Based RNG
In this 2017 GDC Math for Game Programmers talk, SMU Guildhall's Squirrel Eiserloh discuss RNGs vs. noise functions, and shows 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. Join the GDC mailing list: http://www.gdconf.com/subscribe Follow GDC on Twitter: / official_gdc GDC talks cover a range of developmental topics including game design, programming, audio, visual arts, business management, production, online games, and much more. We post a fresh GDC video every day. Subscribe to the channel to stay on top of regular updates, and check out GDC Vault for thousands of more in-depth talks from our archives.

Math for Game Programmers: Juicing Your Cameras With Math

We're 99.9% sure this pattern is true, but no one can prove it

Rules of the Game: Five Further Techniques from Rather Clever Designers

Reinventing Entropy | Compression is Intelligence Part 1

Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup

Math for Game Programmers: Building a Better Jump

The Free Version Of StarCraft Is NOT What It Seems...

Failing to Fail: The Spiderweb Software Way

Building the PERFECT Linux PC with Linus Torvalds

Game Engine Architecture: Bill Clark (CodeLabs Tech Talk 2020)

Cold, Hard Cache Insomniacs Cache Simulator

Why AI Can Never Escape Turing's 1936 Proof

Board Game Design Day: White, Brown, and Pink: The Flavors of Tabletop Game Randomness

50 Game Camera Mistakes

The most beautiful formula not enough people understand

Co-Creator of Haskell: Why Learn Functional Programming, Useless vs Useful Languages | Simon Jones

But what is quantum computing? (Grover's Algorithm)

Tech Toolbox for Game Programmers

Why Dark Souls Is The 'Ikea' Of Games

