Question

On an infinite grid of squares, 6 squares are marked, as in the diagram. How many squares contain stones? In one move, a stone can be removed if it has no adjacent stone above and to its right; then, two stones are placed in the squares above and to the right of the removed stone. Can we remove all stones from the marked squares if the initial state is:
A. (8 points) All marked squares.
B. (8 points) Only the bottom-left marked square.


O O 
O O O

M. Konvitz'


Topics:
Combinatorics -> Invariants Combinatorics -> Combinatorial Geometry -> Grid Paper Geometry / Lattice Geometry
Sources:
There are no comments yet.
Authentication required

You must log in to post a comment.

Log in