| Put N knights on a chessboard so that they do not attack each other and all the free squares are attacked | |
|---|---|
Complexity (1-100): 25
Example: the following picture shows one of the solutions for N=14. ![]() |
|
| Solution: | solution.pas |
Book of programming problems is powered by UseBB 1 Forum Software | Contact Admin