Intelligent Games Lecture (UniBe 2006). This package contains the algorithm to evaluate a formal description of a finite, neutral combinatorical game, means calculate followers and grundy values of a game (see Game Theory).
Besides, some supportive code to (polymorphically) calculate mex-values, any-sized integer-partitions (e.g. 4=1+3=2+2=1+1+2, ...), nim-sums and sprague-grundy values of games.
The package "Intelligent Games" does not include any kind of game