PhD Thesis Defense - Matthew Ferland

PhD Thesis Defense: Matthew Ferland  
 
Committee: Shanghua Teng (Chair), David Kempe, Jiapeng Zhang, Larry Goldstein (Math)      
 
Title: Exploring the Computational Frontier 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. More specifically, computational properties involving evaluating mathematical analysis tools for combinatorial games, such as Grundy values and confusion intervals, as well as identifying what can be determined about these games using simple oracle models.

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

Audiences: Everyone Is Invited

Contact: CS Events