Difference between revisions of "1995 OIM Problems/Problem 4"
(Created page with "== Problem == Pieces are placed on a board with <math>m \times n</math> squares. Each piece placed on the board "''dominates''" all the squares in the row (-), column (|) and...") |
(No difference)
|
Latest revision as of 14:50, 13 December 2023
Problem
Pieces are placed on a board with squares. Each piece placed on the board "dominates" all the squares in the row (-), column (|) and diagonal (\) to which it belongs (*). Find the smallest number of pieces that must be placed so that all the squares on the board are "dominated."
Note (*): Note that the piece does not "dominate" the diagonal (/).
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.