Problem #PRU-32808

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

Problem

Prove that in a game of noughts and crosses on a 3×3 grid, if the first player uses the right strategy then the second player cannot win.