Problem #PRU-35335

Problems Discrete Mathematics Algorithm Theory Game theory Symmetric strategies

Problem

Two boys play the following game: they take turns placing rooks on a chessboard. The one who wins is the one whose last move leaves all the board cells filled. Who wins if both try to play with the best possible strategy?