University of Cambridge > > Churchill CompSci Talks > The Impartial Game of Nim and the Sprague Grundy Theorem

The Impartial Game of Nim and the Sprague Grundy Theorem

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland.

Have you ever wanted to win a game just by choosing whether to start first or second? It turns out that you can, if you are playing the right game. This presentation will introduce the concept of impartial games, studied in Combinatorial Game Theory. I will first state the rules and winning strategy of the Nim game, fundamental for the analysis of every impartial game. Next I will present the statement and proof of the Sprague-Grundy Theorem, which enables us to form an equivalence relation between any impartial game and a Nim heap.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2018, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity