Rare card

Minimax theorem

Value

50 W

Attack

270

Defence

216

Players

1

In the mathematical area of game theory and of convex optimization, a minimax theorem is a theorem that claims that max x ∈ X min y ∈ Y f ( x , y ) = min y ∈ Y max x ∈ X f ( x , y ) {\displaystyle \max _{x\in X}\min _{y\

FrançaisEspañol