Value of the Root Node:

• In game theory, the “root node” refers to the initial state of a game (such as the starting position in chess or the initial configuration in tic-tac-toe).
• The value assigned to this root node represents the overall outcome of the game. Specifically:
  • If the value is +1, it means that the player (Max) who reaches this state wins.
  • If the value is –1, it means that the other player (Min) wins.
  • If the value is 0, the game ends in a draw (neither player wins).

Zero-Sum Games:

• Zero-sum games are a subset of games where the total gain or loss is always zero. In other words, what one player gains, the other player loses.
• Examples include chess, tic-tac-toe, and poker (where chips represent monetary value).
• The assumption is that both players act rationally, aiming to maximize their own gain while minimizing their opponent’s.

Optimal Choices:

• In zero-sum games, players make decisions based on their best interests, assuming their opponent does the same.
• The optimal strategy involves choosing moves that maximize your own payoff while minimizing your opponent’s.