Philip Henderson
Office: Computing Science Centre 2-17 (Algorithmics Lab)
Phone: 780-492-3977
E-mail: ph@cs.ualberta.etc
Research
Topics of Interest
- Graph-theoretic algorithms and data structures
- Artificial intelligence: search algorithms, Monte Carlo methods, constraint satisfaction
- Combinatorial game theory
Overview
I am currently researching the game of Hex with my supervisor Prof. Ryan Hayward. In particular, I am looking for theoretical reductions (combinatorial decompositions, graph-theoretic properties and algorithms, connection strategy computations, dominated and reversible moves, etc) of the game to help improve both automated players and solvers.
Previous research includes bounded-treewidth algorithms and decompositions with Therese Biedl, and constraint satisfaction problem solving for customized engineering design at NRC.
Please see my curriculum vitae and research page for more detailed information.
Teaching
No teaching duties at this time.
Enrolled in the University Teaching Program
Extra-Curricular Activities