Q: Consider a 10 x 10 array of white squares. Colour some initial
set black. Now, if a square has two black orthogonal neighbours, colour
it black. Repeat as much as possible. Show that if the initial set has 9
squares we cannot end with the whole array black.

Dima Fon-Der-Flaass, 24 Feb 1997

Q: More generally, find the minimum initial # blacks required to
turn an `m` x `n` array black.

This page is maintained by Thomas Bending,
and was last modified on Thu 28 July 2022.

Comments, criticisms and suggestions are welcome.
Copyright © Thomas Bending
2022