Tic tac toe

Introduction

Theory

Minimax

Minimax on a general game tree.

Backtracking algorithm: The goal of min player is to get the minimum value and the goal of max player is to get the maximum value (because the players alternate). The value is decided on some heuristics.

Example: Create the game tree, while the value is based on the on the final nodes.