# Let's Play Some Chess-3

**Discrete Mathematics**Level 5

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.