| 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 |
| 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. |
Recommended
