What is the least number of white knights that can be placed on a standard chessboard so that a black piece cannot be added to an unoccupied square without being under attack?

it is elegant, the solution by David. I was wondering though.. i f anyone has given a thought to the algorithm that could produce such a result ?

Posted by zecougar on 2005-09-28 10:38:17