| Savitribai Phule Pune University |
| Title | Two introductory talks on combinatorial game theory |
| Speaker |
Bhalchandra Thatte,
Departamento de Matemátic, Universidade Federal de Minas Gerais, Belo Horizont, Brasil
Bhalchandra Thatte is a professor of mathematics at the Departamento de Matemátic, Universidade Federal de Minas Gerais, Belo Horizont, Brasil. His interests include graph theory and combinatorics, biomathematics, applied probability, algorithms and computing. |
| Date & Time | Wednesday, 31 January 2024 | 14:00-16:00 |
| Venue | In-person: Kelkar Lab, SCMS-SPPU |
| Abstract |
This is a series of two introductory talks on combinatorial game theory.
The mathematics background assumed by the speaker on part of the audience is minimal: High school mathematics for most parts and very elementary probability in the end.
1. Introduction to combinatorial game theory - I (Monday, 29 January 2024, 2-4 PM) We will look at combinatorial games. These are games in which two players take turns, they have complete information and there is no element of chance involved, and a game is guaranteed to end. We will consider many familiar examples, some of which we all played in school. We will them take a slightly careful look at the notion of winning strategy, and discuss Zermelo's theorem and the min-max algorithm. We will also look at the game of Hex and outline the ideas in one of the proofs of existence of a winning strategy. 2. Introduction to combinatorial game theory - II (Wednesday, 31 January 2024, 2-4 PM) In this talk we will study a game called Nim. We will then prove the Sprague-Grundy theorem. I will end the talk with a discussion of some of my joint work with my student Mariana Givisiez Mendes. Our work is based on elementary probabilistic modelling and simulation of some impartial games. |
| Organizer/Host | SCMS-SPPU |
| Slides/Poster |
Wish to subscribe to our announcements list? Send blank email with subject "subscribe" to announce-join AT scms.unipune.ac.in