Source: Sudipta Das.
Jozef Hanenberg simplified the problem by noting: "... a knight on a white field attacks only black fields and vice versa. So let's try to place six knights on the white fields that attack all (30) black fields. A solution is d3, f3, b5, f5, c6 and d7." [The only other pattern which achieves this is to move c6 to b7. Both are shown below. - KD]
...... ....K... .....K.. ..K...K. ........ ..K.K... ........ ...... |
...... ....K.K. ........ ..K...K. ........ ..K.K... ........ ...... | I made the diagram to the right to try to identify black squares as 'o'. You can see that every 'o' is attacked by at least one knight 'K'. |
.o.o.o .o.oKoKo o.o.o.o. .oKo.oKo o.o.o.o. .oKoKo.o o.o.o.o. o.o.o. |
...... ...KK... ..K..K.. .KK..KK. ........ ..KKKK.. ........ ...... |
...... ...KK.K. ..K..... .KK..KK. ........ ..KKKK.. ........ ...... |
...... .K.KK.K. ........ .KK..KK. ........ ..KKKK.. ........ ...... |