Lesson 1

Introduction to Game Playing

In this lesson, you'll learn about how to build a Game Playing AI Agent. You'll focus on an agent that wins in the board game Isolation! You'll learn some of the seminal techniques in AI Game Playing including Adversarial Search and Minimax Trees.

Lesson 2

Advanced Game Playing

In this lesson, you'll build a Game-Playing agent that defeats opponents in Isolation. Along the way, you'll learn about advanced Game-Playing techniques such as Iterative Deepening, Alpha-Beta Pruning, and Expectimax.

Lesson 3

Search

In this lesson, you'll learn how to implement some of the seminal search algorithms that are a cornerstone of AI including Breadth-First Search, Depth-First Search, and finally A Star Search. You'll then put your skills to the test by teaching Pac-Man to navigate his world and complete complex tasks such as finding the fastest path through the map while maximizing points scored.

Lesson 5

Constraint Satisfaction

In this lesson we'll return to one of the main techniques we used to solve Sudoku - constraint propagation. We'll see how to use known constraints to solve a wide variety of problems including Map Coloring problems, and simple puzzles.