Problem #PRU-100347

Problems Algorithm Theory Game theory Game theory (other) Discrete Mathematics

Problem

Show that in the game “Noughts and Crosses” the second player never wins if the first player is smart enough.