It reduces the number of nodes evaluated by eliminating branches that cannot affect the final decision.

It calculates the exact probability of winning for each player.

It extends the search depth uniformly for all branches.

It allows players to revise their strategies based on the opponent's moves.

It enhances the accuracy of the final score calculation.

The sum of the gains and losses of the players is zero, meaning one player’s gain is another’s loss.

Players collaborate to maximise a shared objective.

Both players have unlimited resources to compete with.

Each player’s strategies are publicly known to the other.

The game continues indefinitely without a clear winner.

The best worst-case outcome for the player making a move.

The minimum value a player will accept in a negotiation.

The lowest score a player can achieve in the game.

The maximum number of moves a player can make.

The minimum loss expected by a player, assuming both play optimally.