Y by
An and Binh play a game on a square board of size (2n+1)x(2n+1) with An going first. Initially, all the squares on the board are white. In each turn, An colors a white square blue and Binh colors a white square red. The game ends after both players have colored all the squares on the board. An wins if, for any two blue squares, there exists at least one chain of neighboring blue squares connecting them (two squares are called neighboring if they have at least one vertex in common). Otherwise, Binh wins. Determine the player with the winning strategy in the following cases:
a) with n=1
b) with n>=2
a) with n=1
b) with n>=2