Ryan Hayward, PhD

Professor, Faculty of Science - Computing Science

Contact

Professor, Faculty of Science - Computing Science
Email
hayward@cs.ualberta.ca

Overview

About

Education

  • B.Sc. Honours, Mathematics, Queens University, 1981
  • M.Sc., Mathematics, Queens University, 1982
  • Ph.D., Computer Science, McGill University, 1987

Positions

  • Department Outreach & Diversity Director


Research

Areas

Algorithmics

Summary

I am interested in algorithms, especially those related to classic 2-player games such as Go or Hex, and to the latest techniques in artificial intelligence that help build artificial agents to play such games.  I am also interested in algorithms related to famous problems in graph theory, for example the four-colour problem or the perfect graph theorem.


Courses

CMPUT 304 - Algorithms II

The second course of a two-course sequence on algorithm design. Emphasis on principles of algorithm design. Categories of algorithms such as divide-and-conquer, greedy algorithms, dynamic programming; analysis of algorithms; limits of algorithm design; NP-completeness; heuristic algorithms. Prerequisites: CMPUT 204; one of STAT 141, 151, 235 or 265 or SCI 151; one of MATH 225, 227, 228 or consent of the instructor.

Fall Term 2020
CMPUT 355 - Games, Puzzles, Algorithms

An introduction to algorithms and theory behind computer programs that solve puzzles (mazes, peg solitaire, etc.) or play games (chess, Go, Hex, etc.). This course is intended for a general audience. Prerequisite: any 200-level CMPUT.

Fall Term 2020
CMPUT 670 - Topics in the Theory of Computation

Winter Term 2021

Browse more courses taught by Ryan Hayward