More cards in this set

Card 6

Front

The vertex you arrive at having taken an an action is the

Back

Preview of the front of card 6

Card 7

Front

A minimax problem is one where

Back

Preview of the front of card 7

Card 8

Front

The value of a cut is calculated using

Back

Preview of the front of card 8

Card 9

Front

The Hungarian algorithm

Back

Preview of the front of card 9

Card 10

Front

In a zero sum game there wil be a stable solution if and only if

Back

Preview of the front of card 10

Card 11

Front

A saddle point is

Back

Preview of the front of card 11