on
Course Material: Introduction to Artificial Intelligence
The following material is heavily based on material developed by many individuals for CSC384 taught at the University of Toronto. All typos are my own.
If you would like the original source files, please contact me.
Introduction
Our goal is to develop algorithms that can optimally make decisions in various situations. We model these situations as games in the game-theoretic sense. We develop these definitions in greater detail in this module.
Designing algorithms for arbitrary games is quite difficult. Thus, in the following modules, we will begin by making some simplifying assumptions. Later, we will relax these assumptions.
Search Problems and Algorithms
In this module, we consider a type of game called a search problem. We develop algorithms to solve search problems, and then analyze their various properties.