minimaxväärtused
Minimaxväärtused, often translated as minimax values, are a fundamental concept in game theory and artificial intelligence, particularly in the context of zero-sum games. These values represent the best possible outcome a player can guarantee for themselves, assuming their opponent plays optimally to counter them. The minimax algorithm is designed to find these values by exploring the game tree, which represents all possible moves and counter-moves.
In a two-player, zero-sum game, one player's gain is precisely the other player's loss. The minimax algorithm
The algorithm recursively explores the game tree. At terminal nodes (game end states), the value is the