Two people take turns placing bishops on a standard \(8\times8\) chessboard such that the bishops cannot attack each other. Here, the colour of the bishops does not matter. (Note: bishops move and attack diagonally.) A player loses when they cannot place any more bishops (because every square left is attacked by some existing bishop). Assuming that both play perfectly, who has the winning strategy?