Indexing and Iterating Design Space Permutations

In this 2016 GDC session, programmer Nathan Sturtevant covers the mathematics of counting with combinations and permutations, particularly how to compute perfect hash functions (rankings and unrankings) that allow programmers to convert to and from the index of a permutation/combination and an actual game state. Register for GDC: https://ubm.io/341ZiaZ Join the GDC mailing list: http://www.gdconf.com/subscribe Follow GDC on Twitter: https://twitter.com/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.