Knights on a chessboard


In chess a knight may move 2 up/down and one sideways, or 2 sideways followed by one up/down. See the following illustration:
chessboard knightmoves

How many knights can you put on a normal 8×8 chessboard so that no knight may take another knight? And can you show that that is the maximum?

This problem was posted at the Dutch mathematics olympiad 1996.

You can check your solution here

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s