a game of nim is traditionally played with heaps of objects called counters. in this game, two players take turns choosing a heap and then removing any positive number of counters from that heap. play continues until the final counter is removed, at which point the player responsible for this is declared the winner. in search of a general winning strategy for nim, we encounter and prove several core principles of combinatorial game theory.