chess problem !!!!!
Level
pending
The top and bottom edges of a chessboard are identi ed together, as are the left and right edges, yielding a torus. Find the maximum number of knights which can be placed so that no two attack each other.
The answer is 32.
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
Since a knight on a white square only attacks dark squares, we can place knights on all the white or dark squares giving us 64/2=32 as our maximum