Tic tac toe: Difference between revisions

From wikiluntti
(Created page with "== Introduction == == Theory == === Minimax ===")
 
Line 4: Line 4:


=== Minimax ===
=== Minimax ===
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. The value is decided on some heuristics.
Example: Create the game tree, while the value is based on the on the final nodes.

Revision as of 12:10, 2 January 2023

Introduction

Theory

Minimax

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. The value is decided on some heuristics.

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