+ Show/hide abstracts and details
Title: Strategy Complexity for Combinatorial Games
Speaker: Shelly Stahl (University of Connecticut)
Time: Wednesday, March 22, 2017 at 5:45 pm
Place: MONT 321Abstract: You may have played cops and robbers on the playground, but have you ever played on a graph? What about playing leapfrog on a grid? In this talk, we will talk about some combinatorial games including Cops and Robbers on Graphs, Toads and Frogs, and Chomp. Many combinatorial games have been mathematically studied to the point of knowing who will win before the game even starts! We will discuss what it means for a game to be ''solved'' or ''determined,'' and introduce tools of computability theory as a way to compare the complexity of various games and strategies.Comments: Free pizza and drinks!
Organizer: Keith Conrad