BISHOPS—GUARDED
Now, how many bishops are necessary in order that every square shall be either occupied or attacked, and every bishop guarded by another bishop? And how may they be placed?
Topics:
Combinatorics
->
Combinatorial Geometry
Minimum and Maximum Problems / Optimization Problems
Combinatorics
->
Colorings
->
Chessboard Coloring
- Amusements in Mathematics, Henry Ernest Dudeney Question 298
There are no comments yet.