Daily Math Puzzle 2026/10/26
English
Let \(n\) be a positive integer. Color some cells of an initially white \((2n+1)\times(2n+1)\) grid black. An opponent then chooses one black cell and turns it white again. After that, repeatedly color a white cell black if it shares an edge with at least two black cells, until no further move is possible. We want the entire grid to end up black, whichever cell the opponent turns white. Find the minimum number of cells that must be colored black initially.
日本語
\(n\) を正の整数とする. \((2n+1)\times(2n+1)\) の白い方眼の何マスかを黒く塗る. その後,相手が黒いマスを一つ選んで白に戻す. それから,辺を共有する黒いマスが二つ以上ある白いマスを黒く塗る操作を,できなくなるまで繰り返す. 相手がどのマスを白に戻しても,最後に全マスが黒くなるようにしたい. 最初に黒く塗るマスの個数の最小値を求めよ.
Try it
- 0
- 0
- 0
- —