Removal

Logic Level 1

Alice and Bob are playing a game of Removal on an n×mn\times m board. Some cells have a chip each on them and some don't. Both players move alternately. Each move consists of removing all chips from a non-empty row or column. The last player who removes all the chips wins.

Here is the configuration of the 3×53\times 5 board. Alice will play first. Assuming that both of them play optimally, who will win the game?

×

Problem Loading...

Note Loading...

Set Loading...