PhD Thesis Proposal - Matthew Ferland

Event: PhD Thesis Proposal (Matthew Ferland)
 
Committee: Shanghua Teng, David Kempe, Jiapeng Zhang, Shaddin Dughmi, and Larry Goldstein
 
Date: February 1, 2024, 12:30pm – 2:00pm
 
Title: Exploring the complexity landscape of combinatorial games
 
Abstract: People have been playing games since before written history, and many of the earliest games were combinatorial games, that is to say, games of perfect information and no chance. This type of game is still widely played today, and many popular games of this type, such as Chess and Go, are some of the most studied games of all time. This proposed work resolves around a game-independent systemic study of these games, involving computational properties involving evaluating the mathematical analysis tools, such as sprague-grundy values and switches, as well identifying what can be determined about these games under simple oracle models.
 
 
 

Location: Henry Salvatori Computer Science Center (SAL) - 213

Audiences: Everyone Is Invited

Contact: CS Events