What is the smallest number of knights that you would need to place on a chessboard so that every vacant square could be reached by a knight in one move?
8
16
12 ?
i read dis question somewer b4 as wel .... i guess....
& i guess da possible positions of knights r lyk dis
am i correct ?
i second winx answer..
even though i cant think of something good
JPG, GIF or PNG only, Max size: 2MBTip: Resize your image before uploading
Sign up
Login