Overview
My research area is combinatorial game theory, the study of two-player games of perfect information and no chance. I am specifically interested in games under misere play, where the first player unable to move wins, as opposed to normal play, when the first player unable to move loses.
I am also interested in graph theory, including problems of graph searching and games on graphs.
Current research
"Combinatorial Games and Graph Optimization: Scoring and Losing, Packing and Walking." Funded by NSERC Discovery Grant 2017–2026.
PhD thesis
"Restricted Universes of Partizan Misere Games" (Dalhousie, 2013)
Master's thesis
"The Watchman's Walk Problem and Its Variations" (Memorial, 2009)