You are just going to play a game called "Bishop Removed". The rules are simple. Initally, every square of a chess board contains a bishop . On a single turn you are supposed to remove a bishop which is currently attacked by an even number of bishops. The game ends when you are unable to make a turn. Your score at the end of the game is the total number of bishops you removed. What is the maximum possible score you can attain?
Also try other problems of the set Let's play some chess .
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.
No explanations have been posted yet. Check back later!