Minimax theorem guarantees a value in zero-sum games
In any finite two-person zero-sum game, if players may randomize over their pure strategies, the maximum payoff one player can guarantee equals the minimum loss the other can hold them to. This common number is the value of the game. Each side can secure it no matter what the opponent does, so the game has a determinate solution even though neither player can see the other's move.