Removal
Alice and Bob are playing a game of Removal on an 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 board. Alice will play first. Assuming that both of them play optimally, who will win the game?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Alice just needs to wipe out the first column. Then whatever Bob does, on her second move, Alice can leave Bob with 2 chips both in different rows and different columns, leaving her the victor! :)