Consider the following 2-player game: there is a single chip placed in the square at the top right corner of a 5 5 board. players take turns moving the chip to a neighboring square, i. e. they are allowed to move the chip to the square to the north, south, east or west (staying within the board at all times). the only constraint is that no player can move the chip to a square that has been visited/occupied in the past. the player unable to move the chip loses. which player has the winning strategy and what is it?