معرفی
Craig Tennenhouse is a Professor in the School of Computer Science and Data Analytics at the University of New England. He holds a Ph.D. in Applied Mathematics from the University of Colorado Denver and has previously served as an Associate and Assistant Professor at UNE, as well as teaching roles at Simpson University and Jamestown College. His research spans Graph Theory, Combinatorial Game Theory, and Evolutionary Algorithms.
- Ph.D. in Applied Mathematics, University of Colorado Denver
- M.A. in Mathematics, University of Colorado
- A.B. with Honors in Mathematics, University of Chicago
- Junior Year Abroad, University of Edinburgh
Craig’s research focuses on structural properties of graphs, combinatorial game complexity, and genetic algorithm applications. He has authored 15+ peer-reviewed publications, including work on Hnefatafl complexity, Olympic Games with infinite octal codes, and graph saturation extensions. His recent projects explore game state analysis using genetic programming and graph-based modeling.
He has received multiple awards, including the Eleanor DeWolfe Ludcke Professorship, NSF grants, and teaching excellence awards. Craig is actively involved in undergraduate research mentoring and serves as a referee for academic journals. His teaching methodology includes inquiry-based learning, flipped classrooms, and integration of game theory into coursework.
