Domination Problems II
DOMINATION PROBLEMS II
What is the minimum number of pieces needed to attack every square on the board,
including those already taken?
PUZZLE EXAMPLE:
1. Dominate all squares on a 7x7 chessboard with the minimum number of Knights.
Solution:
2. Dominate all squares on a 5x5 chessboard with the minimum number of Bishops.
To continue experimenting with more puzzles, feel free to visit:
