Problem #PRU-100347

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

Problem

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