Please enable JavaScript to use CodeHS

Introduction to Artificial Intelligence

View Syllabus Overview

Lesson 2.5 Minimax

Description

In this lesson, students will learn how to implement minimax, a search tree algorithm used to create realistic non-player characters, in their own Tic Tac Toe game.

Objective

Students will be able to:

  • Define minimax
  • Identify the base and recursive case in the minimax algorithm
  • Implement minimax in a working program

Activities

These are all the activities included in the lesson

2.5.1 Creating a Search Tree Algorithm
2.5.2 Tic Tac Toe with Minimax
2.5.3 Implement Minimax Base Case
2.5.4 Implementing Minimax Recursive Case
2.5.5 Tracing Our Program
2.5.6 Tracing Our Program Reflection
2.5.7 Getting the Row Col Values
2.5.8 Complete Game with Minimax
2.5.9 Tic Tac Toe with Minimax Reflection