Tic tac toe: Difference between revisions
From wikiluntti
| (One intermediate revision by the same user not shown) | |||
| Line 5: | Line 5: | ||
=== 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. | [[File:Minimax.svg|thumb|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. | Example: Create the game tree, while the value is based on the on the final nodes. | ||
Latest revision as of 12:28, 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 (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.
