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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The Impartial Game of Nim and the Sprague Grundy Theorem

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Latimer Room, Old Court Clare College, Trinity Lane, Cambridge CB2 1TL Webinar & GN06, Computer Laboratory, William Gates Building. Lecture Theatre, Dept of Architecture

Other talks

Trigger-Level Analysis at ATLAS Title to be confirmed CSAR lecture: In a post-Ozempic world, have we cured obesity? The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck Cooperation for Nature Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity