If you place white and black knights on a chessboard such that every white knight is attacked by at least one black knight and every black knight is attacked by at least one white knight, what's the maximum number of knights possible?
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.
We can, for example, place 8 of each colour in a checkerboard pattern by placing them on squares of their own colour. But there are many possible solutions that achieve this maximum.
Perhaps we could also ask: