Problem #PRU-30441

Problems Set theory and logic Theory of algotithms Game theory Symmetric strategies

Problem

Two people take turns placing bishops on a chessboard such that the bishops cannot attack each other. Here, the colour of the bishops does not matter. (Note: bishops move and attack diagonally.) Which player wins the game, if the right strategy is used?