You've been logged out of GDC Vault since the maximum users allowed for this account has been reached. To access Members Only content on GDC Vault, please log out of GDC Vault from the computer which last accessed this account.

Click here to find out about GDC Vault Membership options for more users.


The Number One Educational Resource for the Game Industry

Session Name: Math for Game Programmers: Indexing and Iterating Design Space Permutations
Speaker(s): Nathan Sturtevant
Company Name(s): University of Denver / NS Software
Track / Format: Programming

Did you know free users get access to 30% of content from the last 2 years?

Get your team full access to the most up to date GDC content

Overview: This session will cover the mathematics of counting with combinations and permutations. In particular, we will look at how to compute perfect hash functions (rankings and unrankings) that allow us to convert to and from the index of a permutation/combination and an actual game state. These hash functions allow for efficient pre-computation of combinatorial data that has a wide variety of applications in game and AI design. In addition to use-case examples, sample code will be provided that performs these computations.

GDC 2016

Nathan Sturtevant

University of Denver / NS Software

free content